auto save

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 = 15
+high = len(num_list)-1
+low = 0
+num = 9
+mid = 0
+while True:
+    mid = (low + high) // 2
+    if num_list[mid] == num:
+        print("找到了"+str(num)+"在索引值为"+str(mid))
+        break
+    elif num_list[mid] < num:
+        low = mid + 1
+    elif low < high:
+        print(str(num)+"在列表中不存在")
+        break
+    else:
+        high = mid - 1
+    
+    
+