save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+def binary_search(alist,num):
+    low=0           #最低索引
+    high=len(num_list)-1        #最高索引
+    while low<=high:            #最低索引小于等于最高索引
+        mid=(low+high)//2
+        guess=alist[mid]
+        if guess==num:
+            return mid
+        elif guess<num:
+            low=mid+1
+        else:
+            high=mid-1
+r=binary_search(num_list,9)
+print(r)
\ No newline at end of file