auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
\ No newline at end of file
+bingo = 20
+low = 0
+high = len(list)-1
+while low <= high:
+    mid = (low + high)//2
+    guess = list[mid]
+    if guess == bingo:
+        print("有，索引值：",mid)
+        break
+    elif guess < bingo:
+        low = mid + 1
+    else:
+        high = mid - 1
+