Commit c181c39d by BellCodeEditor

save project

parent adaf6f8a
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 binary_search(alist,num):
bingo_num = num # 要查找的数: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:
high = mid-1
\ 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