-
Notifications
You must be signed in to change notification settings - Fork 22
/
search.py
45 lines (34 loc) · 1.73 KB
/
search.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
#!python
def linear_search(array, item):
"""return the first index of item in array or None if item is not found"""
# implement linear_search_iterative and linear_search_recursive below, then
# change this to call your implementation to verify it passes all tests
return linear_search_iterative(array, item)
# return linear_search_recursive(array, item)
def linear_search_iterative(array, item):
# loop over all array values until item is found
for index, value in enumerate(array):
if item == value:
return index # found
return None # not found
def linear_search_recursive(array, item, index=0):
# TODO: implement linear search recursively here
pass
# once implemented, change linear_search to call linear_search_recursive
# to verify that your recursive implementation passes all tests below
def binary_search(array, item):
"""return the index of item in sorted array or None if item is not found"""
# implement binary_search_iterative and binary_search_recursive below, then
# change this to call your implementation to verify it passes all tests
return binary_search_iterative(array, item)
# return binary_search_recursive(array, item)
def binary_search_iterative(array, item):
# TODO: implement binary search iteratively here
pass
# once implemented, change binary_search to call binary_search_iterative
# to verify that your iterative implementation passes all tests below
def binary_search_recursive(array, item, left=None, right=None):
# TODO: implement binary search recursively here
pass
# once implemented, change binary_search to call binary_search_recursive
# to verify that your recursive implementation passes all tests below