auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-def check(n):
+def check(check_list,n):
     left = 0
-    right = len(num_list)-1
+    right = len(check_list)-1
     mid = 0
     while True:
         if right < left:
             return "没有"
         mid = (left+right)//2
-        num = num_list[mid]
+        num = check_list[mid]
         if num == n:
-            return left
+            return mid
         elif num < n:
             left = mid+1
         else:
             right = mid-1
-print(check(20))
\ No newline at end of file
+
+print(check(num_list,11))
\ No newline at end of file