save project

binary_search.py

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