quicksort.py

def quicksort(array):
    if len(array) <= 1:
        return array
    pivot = array[0]
    array.remove(pivot)
    less, greater = [], []
    for x in array:
        if x <= pivot:
            less.append(x)
        else:
            greater.append(x)
    return (quicksort(less) + [pivot] + quicksort(greater))