Python 3 二分查找算法实现

import time

def cal_time(func):
def wrapper(*args,**kwargs):
t1=time.time()
x=func(*args,**kwargs)
t2=time.time()
t=t2-t1
print("It costs:",t2-t1)
return x
return wrapper
#pprint("It Costs {0}:".format(t)


@cal_time
def bin_seach(data_set,value):
low =0
high = len(data_set) -1
while low<=high:
mid=(low+high)//2
if data_set[mid]==value:
return mid
elif data_set[mid]>value:
high=mid-1
else:
low=mid+1
return


data=list(range(109))

bin_seach(data,3)

 

while n>1:

  print (n)

  n=n//2