Commit befe6fd1 by BellCodeEditor

save project

parent 3f6ac5e5
Showing with 22 additions and 7 deletions
import random #import random
alist = [] #alist = []
for i in range(1, 101): #for i in range(1, 101):
alist.append(i) # alist.append(i)
num = random.choice(alist) #num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num): #def binary_search(alist,num):
\ No newline at end of file # 使用二分查找法,找出9和20在列表里面的索引
bingo_num = 17
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_list[mid]
if guess == bingo_num:
print("找到了,他的索是:",mid)
break
elif guess < bingo_num:
low = mid+1
else:
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