Commit f02ee631 by BellCodeEditor

save project

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