Python之快速排序算法实现(一)

#!/usr/bin/python
def qsort(seq):
    if seq==[]:
        return [];
    else:
        pivot     = seq[0];
        lesser    = qsort([x for x in seq[1:] if x<pivot]);
        greater  = qsort([x for x in seq[1:] if x>pivot]);
        return lesser+[pivot]+greater;
seq = [5,6,67,0,-1,-43,12,79];
print (qsort(seq));

运行结果如图所示：