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:
+def binary_search(alist,num):
+    low = 0
+    high = len(num_list) - 1
+    bingo_num = num
+    while low <= high:
         mid = (high+low) // 2
         mid = (high+low) // 2
         guess_num = num_list[mid]
         guess_num = num_list[mid]
         if guess_num == bingo_num:
         if guess_num == bingo_num:
@@ -14,3 +14,5 @@ while low <= high:
         else:
         else:
             high = mid - 1
             high = mid - 1
 
 
+result = binary_search(num_list,17)
+