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]
-low=0
-high=len(num_list)-1
-while True:
-    quest=int(input("你要找什么？"))
+def x(quest):
+    low=0
+    high=len(num_list)-1
     while True:
     while True:
         mid=(low+high)//2
         mid=(low+high)//2
         if num_list[mid]>quest:
         if num_list[mid]>quest:
             high=mid-1
             high=mid-1
         elif num_list[mid]==quest:
         elif num_list[mid]==quest:
             print('找到了,索引是：',num_list[mid])
             print('找到了,索引是：',num_list[mid])
+            break
         elif high<low:
         elif high<low:
             print('没找到')
             print('没找到')
             break
             break
         else:
         else:
             low=mid+1
             low=mid+1
+x(4)
\ No newline at end of file