一 代码
defBinarySearch(l,key):
low =0
high = len(l)-1
i =0
while(low <= high):
i = i+1
mid =(high + low)//2
if(l[mid]< key):
low = mid +1
elif(l[mid]> key):
high = mid -1
else:
print('use %d times is'% i)
return mid
return-1
if __name__ =='__main__':
l =[1,5,6,9,10,51,64,65,87]
print(BinarySearch(l,5))
print(BinarySearch(l,10))
print(BinarySearch(l,65))
print(BinarySearch(l,70))
二 运行结果
use 2 times is
1
use 1 times is
4
use 3 times is
7
-1