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
+mid = (low + high)//2
+guess = 
+if guess = mid:
+    print('找到了')
+elif mid < guess:
+    low = mid+1
+else:
+    high = mid - 1
\ No newline at end of file