save project

binary_search.py

 # 使用二分查找法，找出20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-low=0
-num=20
-high=len(num_list)-1
-
-while low<=high:
-    mid=(low+high)//2
-    guess=num_list[mid]
-    if guess==num:
-        print("找到了")
-        break
-    elif guess<num:
-        low=mid+1
-    else:
-        high=mid-1    
\ No newline at end of file
+num_list1 = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+num1=20
+def name(num_list,num):
+    low=0
+    high=len(num_list)-1
+    while low<=high:
+        mid=(low+high)//2
+        guess=num_list[mid]
+        if guess==num:
+            print("找到了")
+            return mid
+        elif guess<num:
+            low=mid+1
+        else:
+            high=mid-1 
+    return("没找到")   
+print(name(num_list1,num1))
+# print(num1)
\ No newline at end of file