Python 冒泡排序

#!/usr/bin/env pythone3

#通过冒泡排序的方式，把列表进行排序


优化前

count=0
number = [10,5,3,20,7,50,35,21,2,9,1,45,15]
total=len(number)
for a in range(total):
    for i in range(len(number)-1):
        if number[i] > number[i+1]:
            tmp = number[i+1]
            number[i+1] = number[i]
            number[i] = tmp
        count+=1
    #     print(number)
    # print(number)

print("优化前循环次数是：",count+total)


#优化后
count=0
number = [10,5,3,20,7,50,35,21,2,9,1,45,15]
total=len(number)
for a in range(1,total-2):  #给a设置一个默认值range(1,len(number))，1是给设置的默认值
    for i in range(len(number)-a ):
        if number[i] > number[i+1]:
            tmp = number[i+1]
            number[i+1] = number[i]
            number[i] = tmp
        count+=1
        print(number)
    print(number)

print("优化后循环次数是：",count+total)


'''
次数减少的主要原因是去掉了重复执行的次数，可以通过计数器和打印明细可以更好的理解

'''