冒泡排序算法(修正)
a = [45,12,53,2,35]
for i in range(len(a)-1):
for j in range(len(a)-1 - i):
if a[j] > a[j+1]:
t = a[j]
a[j] = a[j+1]
a[j+1] = t
for j in a:
print(j)
冒泡排序算法(修正)
a = [45,12,53,2,35]
for i in range(len(a)-1):
for j in range(len(a)-1 - i):
if a[j] > a[j+1]:
t = a[j]
a[j] = a[j+1]
a[j+1] = t
for j in a:
print(j)