代码如下
使用递归算法实现冒泡排序算法
import random
def diguimaopao(alist):
isChange=0
for i in range(len(alist)-1):
if alist[i]>alist[i+1]:
alist[i],alist[i+1]=alist[i+1],alist[i]
isChange=1
if isChange == 1:
diguimaopao(alist)
alist=[]
n=int(input("请输入一个整数:"))
for i in range(n):
alist.append(random.randint(1,100))
print(alist)
diguimaopao(alist)
print(alist)