#冒泡排序
#让一个数字和它相邻的下一个数字进行比较,如果前一个数字大于后一个数字,交换两个数据的位置
num = [6,5,3,1,8,7,2,9,4]
i = 0
while i < len(num) - 1: #i = 9
i += 1
n = 0
while n < len(num) - 1:
if num[n] > num[n + 1]:
num[n],num[n+1] = num[n+1],num[n]
n += 1
print(num)
结果
[5, 3, 1, 6, 7, 2, 8, 4, 9]
[3, 1, 5, 6, 2, 7, 4, 8, 9]
[1, 3, 5, 2, 6, 4, 7, 8, 9]
[1, 3, 2, 5, 4, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
Process finished with exit code 0