def sort_t(li):
for i in range(len(li)-1):
# 每轮都设置为有序
isSorted = True
for j in range(len(li)-i-1):
if li[j] > li[j+1]:
li[j], li[j+1] = li[j+1], li[j]
# 发生交换,设置成无序
isSorted = False
else:
# 没有交换,设置成有序
isSorted = True
print("第%d轮%d次比较" % (i,j))
print(li)
if isSorted:
break