As you know we can write sparse matrices in compressed row storage (CRS) (or alternatively, compressed sparse row (CSR)).Let A be an m n matrix. The transpose of A is an n x m matrix A' such that for all 0 <= i < n and 0 <= j < m, A'(i; j) = A(j; i).
I need to write the algorithm for transposing a matrix in CRS representation. How can i approach this problem?
