Commit dde75420 by BellCodeEditor

save project

parent adaf6f8a
Showing with 18 additions and 3 deletions
import random import random
alist = [] alist = [1,1,1,1,1,1,1,1,1,1,1,1,3,3,3,2,6,5,5,4]
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 low=0
high=len(alist)-1
while low<=high:
mid=(low+high)//2
guss=alist[mid]
if guss==num:
return mid
elif guss<num:
low=mid-1
else:
high=mid+1
return None
result = bbi(alist,num)
print(result)
\ 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