Commit 84d3b07e by BellCodeEditor

save project

parent adaf6f8a
Showing with 10 additions and 0 deletions
......@@ -5,5 +5,14 @@ for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
while low<=high:
mid=(low+high)//2
guess_sum=num_list[mid]
print(mid)
breakelif guess_num < bingo_num:
low=mid+1
elif guess_sum > bingo_num:
high=mid-1
if guess_num=bingo_num:
def binary_search(alist,num):
\ 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