-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_binary_search_client.py
63 lines (46 loc) · 1.72 KB
/
test_binary_search_client.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import pytest
import binary_search_client as bsc
def test_constructor_exception():
with pytest.raises(TypeError):
binary_search = bsc.BinarySearchClient('foo bar')
def test_constructor_success():
items = [1, 10, 100]
binary_search = bsc.BinarySearchClient(items)
assert len(binary_search.items) == 3
def test_find_odd_number_of_items():
items = [10,20,30,40,50]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(10) == 0
assert binary_search.find(20) == 1
assert binary_search.find(30) == 2
assert binary_search.find(40) == 3
assert binary_search.find(50) == 4
def test_find_even_number_of_items():
items = [10,20,30,40]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(10) == 0
assert binary_search.find(20) == 1
assert binary_search.find(30) == 2
assert binary_search.find(40) == 3
def test_find_not_found_left():
items = [10,20,30,40,50]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(-5) is None
def test_find_not_found_middle():
items = [10,20,30,40,50]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(35) is None
def test_find_not_found_right():
items = [10,20,30,40,50]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(555) is None
def test_find_large_list():
items = [x for x in range(10000)]
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(600) == 600
assert binary_search.find(12) == 12
assert binary_search.find(4325) == 4325
def test_find_empty_list():
items = []
binary_search = bsc.BinarySearchClient(items)
assert binary_search.find(5) is None