def insertion_sort_recursive(integers):
    """Performs insertion sort recursively."""
    integers_clone = list(integers)

    def helper(arr, n):
        if n > 0:
            helper(arr, n-1)
            while arr[n] < arr[n-1] and n > 0:
                arr[n], arr[n-1] = arr[n-1], arr[n]
                n -= 1

    helper(integers_clone, len(integers_clone) - 1)
    return integers_clone