auto save

binary_search.py

-# 使用二分查找法，找出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
-mid=(low+high)//2
 guess=20
 guess=20
-while high<=low:
-    if guess==20:
+while high>=low:
+    mid=(low+high)//2
+    print(num_list[mid])
+    if guess==num_list[mid]:
         print("猜到了")
         print("猜到了")
-    elif guess<20:
+        break
+    elif guess>num_list[mid]:
         low=mid+1
         low=mid+1
-    elif guess>20:
+    elif guess<num_list[mid]:
         high=mid-1
         high=mid-1