+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (408k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...