Question

For a sparse matrix, which representation method is generally preferred to save memory and improve computational efficiency?

A Storing it as a dense 2D array
B Using a linked list of non-zero elements (e.g., triplet representation)
C Storing only the diagonal elements
D Converting it to a hash table
E Storing it as a single 1D array
Practice Next

Hey! Ask a query