save project

binary_search.py

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