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]
\ No newline at end of file
+guess=num_list(mid)
+mid=(low+high)//2
+if guess=num:
+    print('找到了')
+elif guess<num:
+    low=mid+1
+else:
+    high=mid-1

d.py

+high = input()
+num_list = input().split()
+bingo_num = input()
+low = 0
+high = len(num_list)
+while low <=high:
+    mid = (low+high) // 2
+    guess_num = num_list[mid]
+    if guess_num == bingo_num:
+        print(mid)
+        break
+    elif guess_num < bingo_num:
+        low=mid+1
+    elif guess_num > bingo_num:
+        high = mid-1 
\ No newline at end of file