Commit 2c8b99c3 by BellCodeEditor

save project

parent 851cff27
Showing with 17 additions and 2 deletions
......@@ -4,6 +4,21 @@ alist = []
for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
print(num)
# 请完善二分查找函数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)
while low<=high:
mid=(low+high)//2
number=alist[mid]
if number==num:
return mid
elif number<num:
low=mid+1
else:
high=mid-1
result=binary_search(alist,num)
print(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