Commit f02ee631 by BellCodeEditor

save project

parent 222c38bd
Showing with 18 additions and 14 deletions
import random
bingo_num=20 alist=[]
num_list=[1,3,5,8,11,15,17,18,20,21] for i in random(1,101):
low=0 alist.append(i)
high=len(num_list)-1 num=random.choice(alist)
while low<=high: def binary_search(alist,num)
mid=(low+high) // 2 low=0
guess_num=num_list[mid] high=len(num_list)-1
if guess_num==bingo_num: while low<=high:
print("找到了,它在列表里的索引是:",mid) mid=(low+high) // 2
break guess=list[mid]
elif guess_num<bingo_num: if guess==num:
low=mid+1 return mid
elif guess_num>bingo_num: elif guess<num:
high=mid-1 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