冒泡排序：

def f(a): n = len(a) for i in range(n): for j in range(n - i - 1): if int(a[j]) > int(a[j +1]): a[j], a[j + 1] = a[j + 1], a[j] return a a=str(input()) a=a.split() a=f(a) for x in a: print(x,end=' ')

s=list(map(int,input().split()))

降序排列：c.sort(reverse=True) 升序排列：c.sort()

a=list(map(int,input().split()))
b=[0]*len(a)
for i in range(0,len(a)):
    x=min(a)
    b[i]=x
    a.remove(x)
print(b)


name=