Question 91
What is the space complexity of storing a Sparse Matrix of size M x N with 'K' non-zero elements using Coordinate Format (COO)?
Sparse matrix formats like COO store triplets (row, col, value) for non-zero elements only, requiring O(K) space where K << M * N. COO stores one row index, one column index and one value per non-zero entry, so storage is Θ(K). The row/column index overhead is included in the constant factor.