Commit b2bd3472 by BellCodeEditor

save project

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