快速排序

1. 快速排序

def quickSort(lyst):
    if len(lyst)<2:
        return lyst
    else:
        center = lyst[0]
        leaster = [i for i in lyst[1:] if i <=center]
        greater = [i for i in lyst[1:] if i>center]
        return quickSort(leaster)+[center]+quickSort(greater)