auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-a = 20
+
+
+
+def wqjvok(alist,num):
+    a = 20
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 x = 0
-g = len(num_list) - 1
+g = len(num_list) - 10
 while  x <= g:
     zj = (x + g) // 2
     cds = num_list[zj]
@@ -12,4 +16,4 @@ while  x <= g:
     elif cds < a:
         x = zj + 1
     elif cds > a:
-        x = zj - 1
\ No newline at end of file
+        x = zj - 1