Commit 2681b9db by BellCodeEditor

auto save

parent aea11dd5
Showing with 16 additions and 4 deletions
import random
alist = []
num=20
alist = [1,3,5,8,11,15,17,18,20,21]
for i in range(1, 101):
alist.append(i)
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
guess=alist[mid]
if guess==num:
return mid
elif guess<num:
low=mid+1
else:
high=mid-1
return None
\ 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