python 3.0冒泡排序算法示例源码

#!/usr/bin/python3
times=0
times2=0
swap=0
whiletime=0
list=[858282,4252,5825725,8752,-2825245,8725,-82257465]

while times2 < len(list) -1:
        whiletime+=1
        while times < len(list)-1:
                whiletime+=1
                times+=1
                if list[times-1] > list[times]:
                        swap+=1
                        #这个交换方式既不优雅，又慢。
                        #a=list[times-1]
                        #b=list[times]
                        #list[times-1]=b
                        #list[times]=a

                        #这个方法很快。
                        list[times-1], list[times] = list[times], list[times-1]

        times2+=1
        times=0

print(list)
print('Swap times:',swap)
print('While times:',whiletime)