Commit 8acafd99 by BellCodeEditor

auto save

parent 0e6c076d
Showing with 2 additions and 0 deletions
# 使用二分查找法,找出9和20在列表里面的索引
bingo_num=20
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
def binary_sear
low=0
high=len(num_list)-1
while low <high:
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment