save project

binary_search.py

 # 使用二分查找法，找出9和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]
\ No newline at end of file
+guess = 20
+low=0
+high=len(num_list)-1
+mid = (low+high) // 2
+while True:
+    mid = (low+high) // 2
+    if guess == num_list[mid]:
+        print("awa")
+        break
+    elif guess < num_list[mid]:
+        high=mid-1
+    else :
+        low=mid+1
\ No newline at end of file