Commit cb290afe by BellCodeEditor

save project

parent 79395db3
Showing with 18 additions and 0 deletions
......@@ -7,4 +7,21 @@ num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
low=0
high=len(alist)-1
while low<=high:
a=(low+high)//2
b=alist[a]
if b==num:
return a
elif a>num:
high-=1
else:
high+=1
return None
result=binary_search(alist,num)
print(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