save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-bingo_num = 20
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-low = 0
-high = len(num_list)-1
+import random
+
+alist = []
+for i in range(1,101)
+    alist.append(i)
+num = random.choice(alist)
+
+def bihnary_searc(alist,num)
+    low = 0
+    high = len(alist)-1
+    while low <= high:
+        mid = (low + high)//2
+        guess = alist[mid]
+        if guess == num:
+            return mid
+        elif guess < num:
+            low = mid + 1
+        else:
+            low = mid - 1
+    return None
+
+result = bihnary_searc(alist,num)
+print('sb',num)
+rint('sb',result)
+
 
 
-while low <= high:
-    mid = (low+high) // 2
-   guess_num  = num_list[mid]
-    if guess_num == bingo_num:
-        print('sbsb',mid)
-        break
-    elif guess_num < bingo_num:
-        low = mid+1
-    elif guess_num > bingo_num:
-        low = mid-1