save project

binary_search.py

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