Commit df69b9ef by BellCodeEditor

save project

parent adaf6f8a
Showing with 18 additions and 2 deletions
......@@ -6,4 +6,21 @@ 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(lista,n):
low=0
high=len(lista)-1
mid=(low+high)//2
guess=lista[mid]
while low<=high:
mid=(low+high)//2
guess=lista[mid]
if guess==n:
return "找到了",str(mid)
elif guess>n:
high=mid-1
elif guess<n:
low=mid+1
return "没有"
print(binary_search(alist,num))
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