Commit 22a8bcf1 by BellCodeEditor

auto save

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