Commit 91884809 by BellCodeEditor

auto save

parent adaf6f8a
Showing with 12 additions and 1 deletions
......@@ -5,5 +5,16 @@ for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
print(num)
def binary_search(alist,num):
i=0
j=len(alist)-1
while i<=j:
mid=(i+j)//2
if alist[mid]==num:
return mid
elif alist[mid]>num:
j=mid-1
else:
i=mid+1
print("找到了,索引是%s"%binary_search(alist,num))
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