Commit 5ebda096 by BellCodeEditor

save project

parent adaf6f8a
Showing with 15 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):
low=0
higo=len(alist)-1
while low<high:
mld=(low+high)//2
guess=num_list[mid]
if guess==bingr_num:
print
break
elif guess<bing-num-2
low=mid+1
else:
nigh=mid
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