Commit f4dfd963 by BellCodeEditor

auto save

parent ad27d285
Showing with 18 additions and 2 deletions
......@@ -6,4 +6,20 @@ 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 a(alist,num):
# 使用二分查找法,找出9和20在列表里面的索引
zhaode=int(input("请输入你要找的数:"))
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
min=0
max=len(num_list)-1
while min<=max:
mid=(min+max)//2
caide=num_list[mid]
if caide==zhaode:
return mid
elif caide<zhaode:
min=mid+1
elif caide>zhaode:
max=mid-1
return None
B
\ 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