Commit 8d398aea by BellCodeEditor

auto save

parent c0855cde
Showing with 15 additions and 2 deletions
......@@ -6,4 +6,17 @@ 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=0
high=len(alist)-1
while low<=high:
mid=(low+high)//2
if num == alist[mid]:
return mid
break
elif num < alist[mid]:
high = mid -1
else:
low = mid + 1
return None
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