Commit c725622e by BellCodeEditor

save project

parent adaf6f8a
Showing with 18 additions and 10 deletions
import random
alist = []
for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file
p=20
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
def g(alist,num):
low = 0
high = len(alist)-1
while low <= high:
mid = (high+low)//2
gusse=alist[mid]
if gusse==num:
return mid
break
elif gusse<num:
low=mid+1
else:
high=mid-1
return None
print(g(num_list,p))
\ 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