Commit 3ad8cd5e by BellCodeEditor

save project

parent 5b2cadb0
Showing with 1 additions and 2 deletions
# 使用二分查找法,找出9和20在列表里面的索引 def binary_search(alist,num)
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
low = 0 low = 0
hight = len(num_list)-1 hight = len(num_list)-1
while low <= high: 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