auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
\ No newline at end of file
+num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+m = 20
+
+low = 0    #最低索引
+high = len(num_list)-1  #最高索引
+while low<high:    #循环条件
+    mid = (low+high)//2    中间索引
+    guess=num_list[mid]    用中间索引取中间值
+    if guess==m:   判断等于说找到
+        print("找到了",mid)
+        break
+    elif guess<m:
+        low = mid + 1
+    else:
+        high = mid - 1