折半查找的流程图及python代码
python代码:
a=3
ls=[-3,-2,-1,0,1,2,4,5,6,7,8,9,10,12,13,14,15,17,19,20,21]
left=0
n=len(ls)
right=n-1
mid=(left+right)//2
while(left<=right):
if(a>ls[mid]):
left=mid+1
elif(a<ls[mid]):
right=mid-1
else:
print(“已找到数字”)
break
mid=(left+right)//2
print(“新的中间位置为”,mid,“元素值为”,ls[mid])
if(left>right):
print(“没找到数字”)
输出结果:
当a=-3时,输出结果: