#二分法查找
def binarySearch(ls, target):
left = 0
right = len(ls)-1
while left <= right:
mid = (left+right) // 2
if target > ls[mid]:
left = mid+1
elif target < ls[mid]:
right = mid-1
else:
return mid
return None
一分钟学会循环方式的二分法查找——python实现
猜你喜欢
转载自blog.csdn.net/qq_50709355/article/details/123314944
今日推荐
周排行