Quick sort implementation in python using recursive calls and for comprehension

quicksort.py

def quicksort(array):
    if len(array) == 0:
        return array
    
    pivot = array[0]
    rest = array[1:]
    
    smallers = quicksort([x for x in rest if x < pivot])
    biggers = quicksort([x for x in rest if x >= pivot])
    
    return [*smallers, pivot, *biggers]
    # for olders version of python
    # return smallers + [pivot] + biggers