Sparse Matrix Operation

Compressed Row Storage (CRS) for Sparse Matrices A dense matrix uses $$O(R\times C)$$ memory even when most entries are zero. The central idea of this implementation is to discard all zeros entirely: each row of the matrix is stored as a list of pairs [non‑zero value, column index]. This compact representation immediately cuts space to O(K) where K is the number of non‑zero elements. The constructor simply iterates through the input matrix, row by row, and collects every…