Commit 2f9955d9 by BellCodeEditor

save project

parent b250abfe
Showing with 13 additions and 2 deletions
# 使用二分查找法,找出9和20在列表里面的索引 # 使用二分查找法,找出9和20在列表里面的索引
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21] def binary_search(alist,num):
\ No newline at end of file low = 0
high = len(alist)-1
while low <= high:
mid = (low + high) // 2
guess = alist[mid]
if guess = num:
return mid
elif guess < num:
low = mid + 1
else:
high = mid - 1
return None
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