save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-bingo_num=20
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-low=0
-hight=(len(num_list))-1
+# 使用二分查找法，找出9和20在列表
+import random
+aist=[]
+for i in range(1,101):
+    alist.append(i)
+num=random.chice(alist)
 
-while low <=high:
-    mid = (low+high)//2
-    guess=num_list[mid]
-    if guess_num == num_list[mid]:
-        print('找到了',mid)
-        break
-    elif guess_num<bingo_num:
-        low=mid+1
-    elif guess_num>bingo_num:
-        high=mid-1
-        
+def binary_sarch(alist,num):
+    low = 0
+    high = len(alist)-1
+    while low <=high:
+        mid = (low+high)//2
+        guess=num_list[mid]
+        if guess_num == num_list[mid]:
+            return did 
+        elif guess_num<bingo_num:
+            low=mid+1
+        elif guess_num>bingo_num:
+            high=mid-1
+    return None
+
+result = binary_sarch(alist,num)
+print('老师给的数是',num)
+print('它在列表里的索引：',result)