December 05, 2017
常见简单算法之 — 二分查找
def binary_search(list, item):
low = 0
high = len(list) - 1
while low <= high:
mid = int((low + high) / 2)
guess = list[mid]
if guess == item:
return mid
if guess > item:
high = mid - 1
else:
low = mid + 1
return None
# test case
test_list = [1, 3, 5, 7, 9]
print(binary_search(test_list, 5))
print(binary_search(test_list, -1))
Written by ricosmall.
Github