def binary_search(list, item):
low = 0
high = len(list)-1
while low <= high:
mid = int(low + high)
guess = list[mid]
if guess == item:
return mid
if guess > item:
high = mid - 1
else:
low = mid + 1
return None
my_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
print(binary_search(my_list, 1))
我是编程的初学者。我正在阅读Aditya Y Bhargava撰写的“ Grokking算法”这本书。”在第一个代码中,我发现了一个错误。该书描述了二进制算法。它说...