#二分法查找
def binaSearch(li,tv):
li.sort()
print(li)
left=0
right =len(li)-1
while left<= right:
mid = (left+right) // 2
if li[mid] == tv:
return mid
elif li[mid] > tv:
right = mid -1
else:
left = mid + 1
else:
return -1
li = [534,54,2,5,732,8,77,4]
print(binaSearch(li,5))
查找:python实现二分法
猜你喜欢
转载自blog.csdn.net/u013963379/article/details/112561389
今日推荐
周排行