Commit a7e8f93e by BellCodeEditor

auto save

parent adaf6f8a
Showing with 16 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,high=0,len(alist)-1
mid=(low+high)//2
while low<=high:
mid=(low+high)//2
if alist[mid]==num:
print(mid)
break
elif alist(mid)>num:
high=mid-1
else:
low=wid+1
else:
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