save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-bingo_num = 8                                                   #要找的数
-low = 0     #左边索引
-high = len(num_list)-1                                          #右边索引
-
-while low <= high:                                              #条件循环
-    mid = (low+high) // 2                                       #中间索引
-    guess_num = num_list[mid]                                   #列表的中间索引对应的数给一个变量
-    if guess_num == bingo_num:                                  #猜的=找
-        print("找到了，索引是:",mid)                             #找到
-        break                                                   #跳出
-    elif guess_num < bingo_num:                                 #猜的<找
-        low = mid+1     #变最小
-    elif guess_num > bingo_num:                                 #猜的>找
-        high = mid-1
-
-
+import random
+
+alist = []
+for i in range(1,101):
+    alist.append(i)
+num = random.choice(alist)
+
+def binary_search(alist,num):
+    low = 0
+    high = len(alist)-1
+    while low <= high:                                              #条件循环
+        mid = (low+high) // 2                                       #中间索引
+        guess_num = num_list[mid]                                   #列表的中间索引对应的数给一个变量
+        if guess_num == bingo_num:                                  #猜的=找
+            print("找到了，索引是:",mid)                             #找到
+            break                                                   #跳出
+        elif guess_num < bingo_num:                                 #猜的<找
+            low = mid+1     #变最小
+        elif guess_num > bingo_num:                                 #猜的>找
+            high = mid-1
+    return None
+print("数是：",binary_search)    
+print("索引是：",result)