《算法图解》--[美] Aditya Bhargava
这本书蛮薄的,不到二百页。
python代码,合我胃口,
于是,就找时间看完,顺便练练码。
二分法查找算法:
def binary_search(list, item): low = 0 high = len(list) - 1 while low <= high: mid = (low + high) // 2 guess = list[mid] if guess == item: return mid if guess > item: high = mid - 1 else: low = mid + 1 return None my_list = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19] print(binary_search(my_list, 11)) print(binary_search(my_list, -1))