save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-low = 0
-high = len(num_list) - 1
-bingo_num = 20
-while low <= high:
-    mid = (high+low) // 2
-    guess_num = num_list[mid]
-    if guess_num == bingo_num:
-        print(mid)
-        break
-    elif guess_num < bingo_num:
-        low = mid + 1
-    else:
-        high = mid - 1
+def binary_search(alist,num):
+    low = 0
+    high = len(num_list) - 1
+    bingo_num = num
+    while low <= high:
+        mid = (high+low) // 2
+        guess_num = num_list[mid]
+        if guess_num == bingo_num:
+            print(mid)
+            break
+        elif guess_num < bingo_num:
+            low = mid + 1
+        else:
+            high = mid - 1
+
+result = binary_search(num_list,17)