auto save

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
-num=19
-while True:
-    mid=(low+high)//2
-    guess=num_list[mid]
-    if guess == num:
-        print(num,"的索引为:",mid)
-        break
-    elif guess < num:
-        low=mid+1
-    elif guess > num:
-        high=mid-1
-    if not num in num_list:
-        print("num_list没有",num)
-        break
+def search(num,_list):
+    low=0
+    high=len(_list)-1
+    while True:
+        mid=(low+high)//2
+        guess=_list[mid]
+        if guess == num:
+            return mid
+        elif guess < num:
+            low=mid+1
+        elif guess > num:
+            high=mid-1
+        if not num in _list:
+            return False
+a=search(11,num_list)
+print(a)
\ No newline at end of file