python二分法查找(1)
二分查找
核心思想:掐头去尾取中间,每次能够排除一半的数据、查找效率非常高,但是也有一定的局限性。
被查找的对象必须是有序序列,以列表为例:
lst = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]
n = 12 #查找对象为12
left = 0
right = len(lst) - 1
middle = (left + right)//2
while left <= right:
if lst[middle] == n:
print(“该数存在,在第%d个位置!” %middle)
break
elif n > lst[middle]:
left = middle + 1
right = len(lst) - 1
middle = (left+right)//2
else:
left = 0
right = middle - 1
middle = (left+right)//2
else:
print(“该数不存在!!!”)