complexity of matrix multiplication algorithm - Wikitechy https://www.wikitechy.com/interview-questions/tag/complexity-of-matrix-multiplication-algorithm/ Interview Questions Mon, 20 Sep 2021 10:56:04 +0000 en-US hourly 1 https://wordpress.org/?v=6.9.4 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png complexity of matrix multiplication algorithm - Wikitechy https://www.wikitechy.com/interview-questions/tag/complexity-of-matrix-multiplication-algorithm/ 32 32 What is the time complexity of adding three matrices of size NXN cell-by-cell ? https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/ https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/#respond Fri, 27 Aug 2021 00:44:12 +0000 https://www.wikitechy.com/interview-questions/?p=2587

What is the time complexity of adding three matrices of size NXN cell-by-cell ?

A. O(N)

B. O(N2)

C. O(N3)

D. None of these

Answer : B. O(N2)

Explanation :

  • Time complexity will be O(n2), because if we add all the elements one by one to other matrics we have to traverse the whole matrix at least 1 time and traversion takes O(n2) times.
  • With this traversion we add 3 elements of location [ i, j ] and storing the result on other matrix at [ i, j ] location.
]]> https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/feed/ 0