{"post":"

Program to find whether a square matrix is

a)symmetric b) skew-symmetric c) none of two

# Understanding the terms

\n
A square matrix is said to be symmetric if its transpose is equal to it:A=A’
\n
Or all elements satisfy the relation:
\n
A[ij] = A[ji]
\n
\n
A square matrix is said to be symmetric if its transpose is equal to its negative:\nAT = -AOr all elements satisfy the relation:
\n
A[ij] = -A[ji]
\n
\n
All diagonal elements of a skew symmetric matrix are zero and for symmetric matrix they can take any value.
\n
\n
a b c b e d c d f is the general form of a symmetric matrix.
\n
\n
0 -b -c b 0 -d c d 0 is the general form of a skew-symmetric matrix.
\n

Now in the given question we have make a program that takes a matrix as input and checks if it is symmetric or skew symmetric or none of them.

# Approaching the problem

We have to check for each element (i,j) of the matrix and compare it with (j,i) and check if they are equal or negative of each other.

To access each element, we will use two nested for loops just like we do when he have to input or print a 2-D array and then we can specify our conditions to check for syymetric and skew symmetric matrices.

We would use a if-else and in if condition we will check for symmetric and inside the else we will check if its skew symmetric or none of above.

# Algorithm

Input from the user the size n of the matrix we wish to check
Input a matrix of size nxn from the user with the help of nested for loops and store it in a 2-D array of size nxn.
Set a variable ctr to 1.
Using a nested for loop check if a[i][j] is equal to a[j][i].if not, set ctr to zero and break out of the loops.
Out of the loop check if ctr is still 1 then its symmetric matrix.
In the else condition, again set ctr to 1 and using a nested for loop check if a[i][j] is equal to -a[j][i].if not, set ctr to zero and break out of the loops.
Out of the loop check if ctr is still 1 then it’s a skew-symmetric matrix and if not then its neither symmetric nor skew symmetric.

Code

#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cout << \"Enter size of square matrix\\n\"; //inputting size of the matrix\n    cin >> n;\n    int a[n][n];\n    cout << \"Enter the matrix row-wise\\n\";  //inputting the matrix row wise\n    for (int i = 0; i < n; ++i)\n    {\n        for (int j = 0; j < n; ++j)\n        {\n            cin >> a[i][j];\n        }\n    }\n    int ctr = 1;\n    for (int i = 0; i < n; ++i)  //check for symmetric matrix\n    {\n        for (int j = 0; j < n; ++j)\n        {\n            if (a[i][j] != -a[j][i])\n            {\n                ctr = 0;\n                break;\n            }\n        }\n        if (ctr == 0)\n            break;\n    }\n    if (ctr)  //printing if matrix is symmetric \n        cout << \"Matrix is skew-symmetric\\n\";\n    else  //checking if skew symmetric matrix \n    {\n        ctr = 1;\n        for (int i = 0; i < n; ++i)\n        {\n            for (int j = 0; j < n; ++j)\n            {\n                if (a[i][j] != (-a[j][i]))\n                {\n                    ctr = 0;\n                    break;\n                }\n            }\n            if (ctr == 0)\n                break;\n        }\n        if (ctr)  //printing if matrix is skew symmetric matrix\n            cout << \"Matrix is skew-symmetric\\n\";\n        else  //if not then its neither of the two\n            cout << \"Matrix is neither symmetric nor skew-symmetric\\n\";\n    }\n    return 0;\n}\n\n

Output

3\n1 2 3\n2 4 5\n3 5 6\n\n\nMatrix is neither symmetric nor skew-symmetric\n\n

\n","title":"Symmetric or Skew symmetric matrix in C++","authorDetails":{"name":"Garvit Gulati","slug":"garvit-gulati"},"description":"Learn how to determine whether a matrix is symmetric or skew symmetric in C++. This article provides a step-by-step guide with code examples to check if a matrix is symmetric or skew symmetric using a simple algorithm and conditional statements. ","slug":"cpp/examples/symmetric-skew-symmetric-program-in-cpp/","articleId":"636a83417bb1ce5072622b54","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}