python 笔记 冒泡排序

numbers = [11,33,55,99,6,13]
print ("original=",numbers)
for j in range(len(numbers) -1, -1, -1):
        for i in range(j):
            if numbers[i] > numbers[i+1]: #把数值小的数字放到顶端
                numbers[i], numbers[i+1] = numbers[i+1], numbers[i]
            print ("i=",i,"j=",j)
            print (numbers)

C:\Users\admin\AppData\Local\Programs\Python\Python35\python.exe D:/OneDrive/python/maopao.py

original= [11, 33, 55, 99, 6, 13]

i= 0 j= 5

[11, 33, 55, 99, 6, 13]

i= 1 j= 5

[11, 33, 55, 99, 6, 13]

i= 2 j= 5

[11, 33, 55, 99, 6, 13]

i= 3 j= 5

[11, 33, 55, 6, 99, 13]

i= 4 j= 5

[11, 33, 55, 6, 13, 99]

i= 0 j= 4

[11, 33, 55, 6, 13, 99]

i= 1 j= 4

[11, 33, 55, 6, 13, 99]

i= 2 j= 4

[11, 33, 6, 55, 13, 99]

i= 3 j= 4

[11, 33, 6, 13, 55, 99]

i= 0 j= 3

[11, 33, 6, 13, 55, 99]

i= 1 j= 3

[11, 6, 33, 13, 55, 99]

i= 2 j= 3

[11, 6, 13, 33, 55, 99]

i= 0 j= 2

[6, 11, 13, 33, 55, 99]

i= 1 j= 2

[6, 11, 13, 33, 55, 99]

i= 0 j= 1

[6, 11, 13, 33, 55, 99]

Process finished with exit code 0

本文出自 “于昊(Pcdog)的博客” 博客，请务必保留此出处http://433266.blog.51cto.com/423266/1740540

python 笔记 冒泡排序

原文：http://433266.blog.51cto.com/423266/1740540