Quick sort algorithm

def QuickSortAlgorithm(arr: list) -> list:    """        [ name ] => Quick Sort        [ type ] => Sorting algorithms        [ time complexity ] => (            1. best case:  O(n log n)            2. average case: O(n log n)            3. worst case: O(n^2) { when the pivot is the (min or max) value of the giving list, or the list is already sorted }        )        [ space complexity ] => O(log n)        [params] => (            arr {list} list to sort        )        [return] => {list} sorted list     """    # size of array    n = len(arr)    if n <= 1:        return arr    # pivote = arr[mid]     pivot = arr[n // 2]    smallerThanPivot = []    greaterThanPivot = []    for i in range(len(arr)):        # do not append pivot to (greaterThanPivot) => continue        if arr[i] == pivot:            continue        # if the element is greater than or equal pivot        if arr[i] >= pivot:            # append the element that is greater than pivot to greaterThanPivot array            greaterThanPivot.append(arr[i])        else:            # if the element is smaller than pivot append it to smallerThanPivot            smallerThanPivot.append(arr[i])    return QuickSortAlgorithm(smallerThanPivot) + [pivot] + QuickSortAlgorithm(greaterThanPivot)