冒泡排序
for j in range(len(m)-1):# 这个是循环的遍数
for i in range(len(m)-1-j):# 这个是list内部循环
if m[i] > m[i+1]:
m[i],m[i+1] = m[i+1],m[i]
# t = m[i]
# m[i] = m[i+1]
# m[i+1] = t
print(m)
冒泡排序
for j in range(len(m)-1):# 这个是循环的遍数
for i in range(len(m)-1-j):# 这个是list内部循环
if m[i] > m[i+1]:
m[i],m[i+1] = m[i+1],m[i]
# t = m[i]
# m[i] = m[i+1]
# m[i+1] = t
print(m)