Quicksort

def quicksort(values):

    if len(values) <= 1:

        return values

    pivot = values[len(values) // 2]

    lo = [x for x in values if x < pivot]

    mid = [x for x in values if x == pivot]

    hi = [x for x in values if x > pivot]

    return quicksort(lo) + mid + quicksort(hi)