auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
\ No newline at end of file
+bingo_num=20
+num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+low = 0
+high = len(num_list)-1  
+# 当最低价格索引，小于等于最高价格时
+while low <= high:
+    mid = (low+high) // 2#取中间价格的索引位置   //取整
+    guess = num_list[mid] # 猜测的数值
+    if guess == bingo_num:
+        print("找到了,他的索引是",mid)
+        break
+    elif guess < bingo_num:
+        low = mid  +1
+    else:
+        high = mid - 1