Given a square matrix of integer numbers, successive sorts of the elements of the matrix and squares of the matrix are performed. The execution finishes after a number (n) of sorts and squares (n sorting and n matrix squares).
A number of problems is solved. For each problem the function to parallelize has:
Input parameters:
-int n: the number of sorts-squares
-int t: the size of the matrix
Input-Output parameter:
-int *a: the matrix txt
Parallelism parameters:
-int nodo: the number of the MPI process
-int np: the total number of MPI processes