For this code challenge, I want to create a performant function that creates a rectangular N-dimensional array. (min_dim_size, max_dim_size) is the span size of every dimension. So rectangular_properties is a list with sizes of every dimension of the matrix. The matrix contains random integer values. Also I want the matrix to be immutable on every dimension.
Now I have this code:
def random_hyperrectangular_matrix(dimensions, min_dim_size, max_dim_size): rectangular_properties = [randint(min_dim_size, max_dim_size) for _ in range(dimensions)] def recc2(dim): if dim == 0: return randint(0, 100) return tuple([recc2(dim - 1) for _ in range(rectangular_properties[dim - 1])]) random_n_dimensional_matrix = recc2(dimensions) return random_n_dimensional_matrix
When I run my code it seems that the generation of this matrix takes a huge amount of time. Is there a lack of performance in it? Does the generation of tuple([...]) out of a list takes much time?