python算法学习笔记1---二分法查找

 1 def bin_search(data_set,val):
 2     low = 0
 3     high = len(data_set)-1
 4     while low <= high:
 5         mid = (low+high)//2
 6         if data_set[mid] ==val:
 7             print("你要找的%d在%d位"%(val,mid))
 8             break
 9         elif data_set[mid] < val:
10             low = mid + 1
11         else:
12             high =mid - 1
13     return
14 a=[2,5,8,9,10]
15 bin_search(a,8)
   你要找的8在2位