auto save

binary_search.py

@@ -2,13 +2,13 @@ bingo_num = 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]
 low = 0
 low = 0
 high = len(num_list)-1
 high = len(num_list)-1
-while low <= high:
+< bingo_num:
+        low = mid+1while low <= high:
     mid = (low+high)//2
     mid = (low+high)//2
     guess_num = num_list[mid]
     guess_num = num_list[mid]
     if guess_num == bingo_num:
     if guess_num == bingo_num:
         print("找到了，他在索引里的是",mid)
         print("找到了，他在索引里的是",mid)
         break
         break
-    elif guess_num < bingo_num:
-        low = mid+1
+    elif guess_num 
     elif guess_num > bingo_num:
     elif guess_num > bingo_num:
         low = mid-1
         low = mid-1
\ No newline at end of file