Commit 829e1624 by BellCodeEditor

save project

parent 2d9a134f
Showing with 19 additions and 15 deletions
bingo_num = 20
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
def binary_search(alist,num)
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
result = binary_search(num_list,20)
print(result)
bingo_num = 20
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
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