排序算法

冒泡

a=[111,22,233,12,3,4]
print a[::-1]
def bubbleSort(alist):
    for passnum in range(len(alist)-1,0,-1):
        print alist,passnum 
        for i in range(passnum):
            if alist[i]>alist[i+1]:
                temp = alist[i]
                alist[i] = alist[i+1]
                alist[i+1] = temp
    return alist
   
print bubbleSort(a)

排序算法

原文：http://www.cnblogs.com/hanxing/p/4346893.html