save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-num=17
-low=0
+num_list1 = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+num1=20
 def cnm(num_list,num):
+    low=0
     high=len(num_list)-1
     while low <= high:
         mid=(low+high)//2
@@ -15,4 +15,4 @@ def cnm(num_list,num):
         else:
             high = mid -1
     return "入木几"
-print(cnm(num_list_1,num_1))
+print(cnm(num_list1,num1))