python实现快速排序

def sortList(alist):
    alen = len(alist)
    if alen == 0:
        return alist
    if alen > 0:
        aitem = alist[alen / 2]
        aleftlist = []
        arightlist = []
        for i in range(0,alen):
            afirstitem = alist[i]
            if i <> alen / 2:
                if afirstitem > aitem:
                    arightlist.append(afirstitem)
                else:
                    aleftlist.append(afirstitem)
        aleftlist = sortList(aleftlist)
        arightlist = sortList(arightlist)
        aleftlist.append(aitem)
        return aleftlist + arightlist

alist = [0,1,2]
print(sortList(alist))

本文出自 “一切有为法，如梦幻泡影” 博客，请务必保留此出处http://kaixinbuliao.blog.51cto.com/2567365/1742348

python实现快速排序

原文：http://kaixinbuliao.blog.51cto.com/2567365/1742348