Commit 18a812ea by BellCodeEditor

save project

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