每次能够排除掉一半的数据,查找的效率非常高,但是局限性比较大。
必须是有序序列才可以使用二分查找。
#递归方法
'''
def ernfen(lst, n, left, right):
if left > right:
return "没有这个数"
middle = (left + right) // 2
if n < lst[middle]:
right = middle - 1
elif n > lst[middle]:
left = middle + 1
else:
return middle
return ernfen(lst, n, left, right)
lst = [1, 4, 5, 6, 8, 9, 11, 15, 17, 18, 19,35, 45, 49, 98, 101, 156, 178, 199,]
left = 0
right = len(lst) - 1
print(ernfen(lst, 50, left, right))
'''
#while方法
lst = [1, 4, 5, 6, 8, 9, 11, 15, 17, 18, 19,35, 45, 49, 98, 101, 156, 178, 199,]
left = 0
right = len(lst) - 1
n = 49
while left <= right:
middle = (left + right) // 2
if n < lst[middle]:
right = middle - 1
elif n > lst[middle]:
left = middle + 1
else:
print(middle)
break
else:
print("没有这个数")