-
个人简介
冒泡排序:
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=' ')
-
最近活动
This person is lazy and didn't join any contests or homework.