auto save

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
+# 使a=9用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+a=9
+b=20
+lou=0
+high=len(num_list)-1
+mid=(lou+high)//2
+if num_list[mid]==a:
+    print("找到了！")
+elif num_list[mid]<a:
+    lou=mid+1
+else:
+    high=mid-1
\ No newline at end of file