Symmetric Matrix

Program:

#include<stdio.h>
int main()
{
int a[4][4],n,i,j,flag=0;
printf("Enter value of n: ");    /*rows and cols*/
scanf("%d",&n);
printf("Enter matrix A row-wise: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("a[%d][%d]=  ",i,j);
scanf("%d",&a[i][j]);
}
printf("\n");
}
printf("Matrix A : \n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%4d",a[i][j]);
}
printf("\n");
}

for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i][j]!=a[j][i])
{
flag=1;
break;
}
}
}
if(flag==1)
{
printf("Not Symmetric Matrix");
}
else
{
printf("Symmetric Matrix");
}
return 0;

}

Output:




No comments:

Post a Comment

x^y using recursion

Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...