auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
\ No newline at end of file
+bingo_num = 9  #要找的数
+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_num:
+        print("找到了，它的索引是：",mid)
+        break
+    elif guess < bingo_num:
+        low = mid +1
+    else:
+        high = mid -1
\ No newline at end of file