Commit 11b73c38 by BellCodeEditor

save project

parent 8cf9cd26
Showing with 23 additions and 8 deletions
import random from random import choice
alist = [] list = []
for i in range(1, 101): for i in range(101):
alist.append(i) list.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file mb = choice(list)
def wow(alist,mb):
low = 0
high = len(alist)-1
while low<=high:
mid = (low+high)//2
gress = alist[mid]
if mb == gress:
return gress
break
elif gress<mb:
low = mid+1
else:
high = mid-1
return None
reuslt = wow(list,mb)
\ 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