save project

binary_search.py

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