作者提供的代码中是这样做二分查找的:
mid = len(lst) // 2
found = False
if lst[mid] == item:
found = True
return found
if mid == 0: #mid等于0就是找到最后一个元素了。
found = False
return found
else:
if item > lst[mid]: #找后半部分
# print(lst[mid:])
return binSearch(lst[mid:], item)
else:
return binSearch(lst[:mid], item) #找前半部分
1 def binarySearch(alist, item):
2
first = 0
3
last = len(alist)-1
4
found = False
5
6
while first<=last and not found:
7
midpoint = (first + last)//2
8
if alist[midpoint] == item:
9
found = True
10
else:
11
if item < alist[midpoint]:
12
last = midpoint-1
13
else:
14
first = midpoint+1
15
16
return found
17
18 testlist = [0, 1, 2, 8, 13, 17, 19, 32, 42,]
19 print(binarySearch(testlist, 3))
20 print(binarySearch(testlist, 13))
近来喜欢递归的简单明了,所以修改成递归的方法
def binSearch(lst, item):
测试通过。