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_num=11
+low=0
+high=len(num_list)-1
+
+while low <= high:
+    mid=(low+high)//2
+    if num_list[mid]==guess_num:
+        print('找到了',mid)
+        break
+    elif num_list[mid]<guess_num:
+        low=mid+1
+    else:
+        high=mid+1