int[] numbers = {1, 3, 9, 12, 32, 41, 45, 62, 75, 77, 82, 95, 99}
查找具体过程如上。
def binary_search(find, L) : low = 0 high = len(L) while low < high : mid = int((low + high) / 2) print(L[mid]) if L[mid] == find : return "目标位置为:%d" % mid elif L[mid] > find : high = mid - 1 else : low = mid + 1 return -1 L = [1,3,9,12,32,41,45,62,75,77,82,95,99] result = binary_search(82, L) print(result)只用两次就可以了啊,45,82