python二分查找
def binarysearch(_list,value):
left = 0
right = len(_list)
mid = int((left+right)/2)
while (left<right):
if value ==_list[mid]:
return mid
elif value<_list[mid]:
right = mid
else:
left = mid
mid = int((left+right)/2)
else:
return -1
# list = [2,1,3,5,6,8,10]
# print(binarysearch(list,10))
本文来自博客园,作者:diablo-427,转载请注明原文链接:https://www.cnblogs.com/diablo-427/p/16936075.html