cs188 python tutorial

quicksort.py

def quicksort(L):

    if len(L) < 2:
        return L

    pivot = L[0]

    less, greater = [], []
    for item in L[1:]:
        (less if item < pivot else greater).append(item)

    ## less = [item for item in L[1:] if item < pivot]
    ## greater = [item for item in L[1:] if item >= pivot]

    return quicksort(less) + [pivot] + quicksort(greater)

print quicksort([0, 3, 2])
print quicksort([1, 3, 2, 2, 1])