1. 二分法查找
a=[-1,0,3,45,55,78,79,83,91,92,93,94,95,100,101,104,200,1000]
target = 200
left = 0
right = len(a)-1
while True:
middle = int((left + right) / 2)
if target == a[middle]:
print(f'position is {middle}')
break
elif target < a[middle]:
right = middle - 1
else:
left = middle + 1