Commit 04496d98 by BellCodeEditor

save project

parent ffeec9b9
Showing with 22 additions and 15 deletions
bingo_num =20
num_list=[1,3,5,8,11,15,17,18,20,21]
low=0
high=len(num_list)-1
import random
ailst=[]
for i in range(1,101):
ailst.append(i)
num = random.choice(ailst)
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:
low=mid+1
else:
high =mid-1
\ No newline at end of file
def binary_search(ailst,num):
low=0
high=len(ailst)-1
while low <=high:
mid=(low+high)//2
guess = ailst[mid]
if guess == num:
return mid
elif guess < num:
low=mid+1
else:
high =mid-1
return None
result = binary_search(ailst,num)
print(num)
print(result)
\ No newline at end of file
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