Commit 80993cab by BellCodeEditor

auto save

parent b250abfe
Showing with 35 additions and 3 deletions
import random
alist=[]
for i in range(1,100)
alist.append(i)
num=random.choice(alist)
def binary_sectch(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
result=binary_sectch(alist,num)
print("老师给的数量:",num)
print("它在列表里的索引是:",result)
# 使用二分查找法,找出9和20在列表里面的索引
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
\ No newline at end of file
bingo_num=20# 使用二分查找法,找出9和20在列表里面的索引
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
low=0
high=len(num_list)-1
while low<high:
mid=(low+high)//2
guess_num=num_list[mid]
if guess_num==bingo_num:
print('找到了,它在列表中的索引是:',mid)
break
elif guess_num<bingo_num:
low=mid+1
elif guess_num>bingo_num:
low=mid-1
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