Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
136599 叶航帅 优化冒泡排序 Python3 Accepted 544 MS 4212 KB 341 2025-11-15 14:26:03

Tests(10/10):


Code:

n = int(input()) a = input().split() a = [int(x) for x in a] n = len(a)-1 for i in range(n): swap = True for j in range(n-i):#Round 1,2,3,4 if a[j]<a[j+1]: a[j],a[j+1] = a[j+1],a[j] swap = False if swap == True: break for i in range(n): print(a[i],end=' ') print(a[n])