save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出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]
\ No newline at end of file
+bingo_num = 9 #需要查找的数字
+low = 0 #左边索引
+high = len(num_list)-1 #最高索引
+
+while low <= high: #条件循环
+    mid = (low+high) // 2 #中间值
+    guess_num = num_kist[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 #最高的