Commit 249c2703 by BellCodeEditor

save project

parent bf7e4d65
Showing with 6 additions and 5 deletions
......@@ -7,17 +7,17 @@ num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
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:
guess=alist[mid]
if guess==bingo:
return True
elif guess_num<bingo_num:
elif guess<bingo:
low=mid+1
else:
high=mid-1
return None
a=binary_search(alist,num)
print(a)
\ 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