save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-low=0
-high=len(num_list)-1
-n=int(input("多少？"))
+import random
+
+alist=[]
+n=1
+low=1
+high=len(alist-1)
+for i in range(1,101):
+    alist.append(n)
+    n+=1
 while True:
     mid=(low+high)//2
-    if n==mid:
+    if n==num_list[mid]:
         print(mid)
         break
-    elif n < mid:
-        low=n+1
+    elif n < num_list[mid]:
+        low=mid+1
     else:
-        low=n-1
-    if low > high:
-        print("没有")
-        break
\ No newline at end of file
+        high=n-1    
+        break
+
+
+
+
+