def short_quick_sort(l):
    if not l:
        return []
    else:
        pivot = l[0]
        less = short_quick_sort([x for x in l[1:] if x < pivot])
        great = short_quick_sort([x for x in l[1:] if x >= pivot])
        return less + [pivot] + great