Commit bf7e4d65 by BellCodeEditor

save project

parent cb4ae1cf
Showing with 16 additions and 2 deletions
......@@ -6,4 +6,18 @@ for i in range(1, 101):
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file
def binary_search(alist,num):
bingo_num=input()
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
low=0
high=len(alist)-1
while low <= high:
mid=(high+low)//2
guess_num=alist[mid]
if guess_num==bingo_num:
return True
elif guess_num<bingo_num:
low=mid+1
else:
high=mid-1
return None
\ 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