save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-n=20
-low=0
-high=len(num_list)
-while low<=high:
+def bin_sea(alist,num):
+    low=0
+    high=len(num_list)
+    while low<=high:
         mid=(low+high)//2
         guess_num=num_list[mid]
         if guess_num==n:
-        print(mid)
+            return mid
             break
         elif guess_num<n:
             low=mid+1
         else:
             high=mid-1
+