Which of the following is the disadvantage of sparse matrices over normal matrices?
c) Easily compressible
d) Algorithm complexity
Explanation: As the sparse matrix contains zeroes we will compute operations only on non-zero values. This increases the complexity of the algorithm as we need to identify the index of zero elements first and during computation, we should not take those indexes. It is a disadvantage. A sparse matrix is easily compressible by not storing the zero/null elements, they require less memory space, also only the non-zero elements have to be computed, hence computational speed increases.