常见的二分法:
def binary_search(list,item):
low = 0
high = len(list) - 1
#print(high)
while low <= high:
mid = int((low + high) / 2)
guess = list[mid]
if abs(guess-item)<0.1:
return mid
if guess > item:
high = mid - 1
else:
low = mid + 1
return -1
如果数据带有一定的规律,这样就显得效率很低了。
假设我知道数据是正向分布的,且带有一定的间隔
可以先找到数据大概区间,再去进行二分法查找
def binary_search_fast(list,item):
low = 0
high = len(list) - 1
dgap=(list[high]-list[low])/high # list average gap
star_mind=int((item-list[low])/dgap)
star_mind=min(max(star_mind,low),high)