defbinarySerach(l,n):
high =len(l)-1# 标记上限
low =0while low<=high :# 控制循环条件
midd=(high-low)//2# 更新标记中间位置if l[midd]== n :return l[midd]elif l[midd]> n :
high=midd-1else:
low=midd+1return-1
l =[1,3,5,7,8,9,10]
flag = binarySerach(l,8)if flag !=-1:print(flag)else:print('不存在!')