save project

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,22,23,24,25,26,27,28,29,30]
\ No newline at end of file
+max_max=len(num_list)-1
+min_min=0
+How_many=int(input())
+while max_max<min_min:
+    in_in=(max_max+min_min)//2
+    if How_many==in_in:
+        pass
+        print(in_in)
+    elif How_many<in_in:
+        max_max=in_in-1
+    else:
+        min_min=in_in+1
+print("????????????????????????????")
\ No newline at end of file