# Is O(n) the Worst case Time Complexity for addition of two Sparse Matrix?

+1 vote
Is O(n) the Worst case Time Complexity for addition of two Sparse Matrix?

(a) True

(b) False

My enquiry is from Arrays Types in division Arrays Types of Data Structures & Algorithms I

I got this question in homework.

+1 vote
by (505k points)
selected by

The correct choice is (a) True

To explain: In Addition, the matrix is traversed linearly, hence it has the time complexity of O(n) where n is the number of non-zero elements in the largest matrix amongst two.

+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote