auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
 abab = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 abab = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 low=0
 low=0
-high=len(abab)-1
-num=int(input("输入："))
-while high>low:
-    mid=(low+high)//2
-    if num==abab[mid]:
-        print("找到了")
-        break
-    elif abab[mid]>num:
-        high=abab[mid]-1
-    else:
-        low=abab[mid]+1
+def b
+    high=len(abab)-1
+    num=int(input("输入："))
+    while high>low:
+        mid=(low+high)//2
+        if num==abab[mid]:
+            print("找到了")
+            break
+        elif abab[mid]>num:
+            high=abab[mid]-1
+        else:
\ No newline at end of file
+            low=abab[mid]+1
\ No newline at end of file