auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-bingo_num=20
+bingo_num=
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 low=0
 high=len(num_list)-1
@@ -11,6 +11,9 @@ while low<=high:
         break
     elif guess_num<bingo_num:
         low=mid+1
-    else:
+    elif guess_num>bingo_num:
         high=mid-1
+if low>high:
+    print('没有')
+