Commit 079bb8ca by BellCodeEditor

save project

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