python实现冒泡排序代码如下，写这个的时候是用扑克牌模拟实现逻辑的
# *-* coding: utf-8 *-*
if __name__ == '__main__':def bubble(a):
counts = 0
for j in xrange(1,len(a)+1):
for i in xrange(len(a)-j):
counts+=1
if a[i] > a[i+1]:
a[i],a[i+1]=a[i+1],a[i]
print a
print a
print counts
#a[0],a[1]=a[1],a[0]
bubble([50, 49, 6, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 23, 24, 25, 22, 20, 21, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 48, 5, 4, 3, 2, 1, 0])
#时间复杂度位O(n**2)
本文永久更新链接地址：http://www.linuxidc.com/Linux/2016-04/129981.htm
