save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+ from random import choice
\ No newline at end of file
+
+list = []
+for i in range(101):
+    list.append(i)
+
+
+mb = choice(list)
+
+def wow(alist,mb):   
+    low = 0
+    high = len(alist)-1
+    while low<=high:
+        mid = (low+high)//2
+        gress = alist[mid]
+        if mb == gress:
+            return gress
+            break
+        elif gress<mb:
+            low = mid+1
+        else:
+            high = mid-1
+    return None
+reuslt = wow(list,mb)