save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+bingo = 100
+num_list = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100]
\ No newline at end of file
+low = 0
+high = len(num_list)-1
+while low <= high:
+    mid = (low+high) // 2
+    guess_num = num_list[mid]
+    if guess_num == bingo:
+        print('找到了，它在列表里的索引是：',mid)
+        break
+    elif guess_num < bingo:
+        low = mid + 1
+    elif guess_num > bingo:
+        high = mid - 1
\ No newline at end of file