save project

binary_search.py

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