save project

binary_search.py

+import random
 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-num=9
-low,high=0,len(num_list)-1
-while True:
+num_list=[]
+for i in range(1,101):
+    num_list.append(i)
+suibian=random.choice(num_list)
+
+def zhao(num_list,num):
+    low,high=0,len(num_list)-1
+    while high>=low:
         mid=(low+high)//2
         mid=(low+high)//2
         guess=num_list[mid]
         guess=num_list[mid]
         if guess == num:
         if guess == num:
             print('找到了','索引',mid)
             print('找到了','索引',mid)
-        break
+            exit()
         elif guess < num:
         elif guess < num:
             low = mid+1
             low = mid+1
         else:
         else:
             high = mid-1
             high = mid-1
-    if high<low:
     print("找不到")
     print("找不到")
-        break
-    
+print(suibian)
+zhao(num_list,suibian)
\ No newline at end of file