auto save

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]
+
+mb = 20
+
+def g(v,c):
+    low = 0
+    hight = len(v)-1
+    while low < hight:
+        mid = (low + hight) // 2
+        n = v[mid]
+        if n==c:
+            return mid
+            break
+        elif n<c:
+            low=mid+1
+        else:
+            high=mid-1
+
+r = g(num_list,20)
+print(r)
\ No newline at end of file