save project

binary_search.py

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