快速排序的简单实现

import random  
  
def quick_sort(L):  
    if len(L) <= 1: return L  
    return quick_sort([lt for lt in L[1:] if lt < L[0]]) + L[0:1]+ \  
    quick_sort([ge for ge in L[1:] if ge >= L[0]])  
  
iList = [random.randrange(1,20) for i in range(10)]  
print(iList)  
print(quick_sort(iList))