1、编写程序,使用递归算法实现冒泡排序算法。
def Mpsort(b,l):
a = b
Len=l
print(Len)
for i in range(0,Len):
for j in range(0,i):
if a[j] > a[i] :
a[i] , a[j] = a[j] , a[i]
for i in range(Len):
print(a[i],end=' ')
a=[]
b=input("input : ")
b=b.split()
for i in b:
t=int(i)
a.append(t)
Mpsort(a,len(a))