D. None of these<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

Answer :\u00a0<\/b>B. O(N2<\/sup>)<\/h3>\n

\n

Explanation :<\/h2>\n<\/div>\n

\n

\n

\n
• Time complexity will be O(n^{2<\/sup>), 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<\/sup>) times.<\/li>\n}
• With this traversion we add 3 elements of location [ i, j ] and storing the result on other matrix at [ i, j ] location.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

  Answer :\u00a0B. O(N2)<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[15949],"tags":[16158,16520,16161,16159,16155,16154,16156,16150,16157,16160,16162,16153,16152,16151],"class_list":["post-2587","post","type-post","status-publish","format-standard","hentry","category-programming","tag-adding-two-nxn-matrices","tag-amcat-previous-papers-with-solutions","tag-complexity-of-addition-of-two-matrices","tag-complexity-of-matrix-multiplication-algorithm","tag-if-the-depth-of-a-tree-is-3-levels","tag-in-which-area-of-a-class-are-data-and-function-directly-accessible-outside-the-class","tag-then-what-is-the-size-of-the-tree","tag-time-complexity-of-adding-three-matrices","tag-time-complexity-of-adding-two-matrices","tag-time-complexity-of-adding-two-numbers","tag-time-complexity-of-addition","tag-what-is-the-complexity-of-matrix-addition","tag-what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn","tag-what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell"],"yoast_head":"\n