auto save

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 = input("请输入要查的数：")
+bingo_num = int(bingo_num)
+low = 0
+high = len(num_list) - 1
+
+#当最低索引小于最高索引的时候
+while low <= high:
+    mid = (low + high) // 2  #取中间数据的索引位置    // 取整
+    find_num = num_list[mid]   #查找的数
+    if find_num == bingo_num:
+        print("找到了，它在列表里的索引值是：",mid)
+        break
+    elif find_num < bingo_num:
+        low = mid + 1
+    elif find_num > bingo_num:
+        high = mid - 1
\ No newline at end of file