冒泡排序法，解构思想 

1 a = [1, 2, 44, 55, 77, 58, 6, 3, 8, 8, 75, 5, 6]
2 k = 0
3 while k < len(a):
4     for i in range(len(a) - 1):
5         if a[i] > a[i + 1]:
6             a[i], a[i + 1] = a[i + 1], a[i]
7         i += 1
8     k += 1
9 print(a)

 

posted @ 2021-10-18 11:39  余鑫2020  阅读(28)  评论(0)    收藏  举报