Pract: Develop a C program to solve linear equation using Gauss Elimination method

#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<ctype.h>

void main()
{
int i,j,k,n=0,m,l,b;
int p,q;
float a[10][10],x[10],t,sum,temp;
clrscr();

printf(“\nSolution of system of equations using Gauss-Elimination Method\n”);
printf(“\nx1 + x2 + x3 = C1\nx1 + x2 + x3 = C2\nx1 + x2 + x3 = C3\n…..\n”);

printf(“\nEnter no. of equations:”);
scanf(“%d”,&n);
printf(“\nEnter Co-efficients of x1,x2,x3 & C\n”);
for(i=1;i<=n;i++)
{
b=1;
for(j=1;j<=(n+1);j++)
{
if(j!=4)
{
printf(“Enter Co-efficient of x%d:”,b++);
fflush(stdin);
scanf(“%f”,&a[i][j]);
}
else
{
printf(“Enter C%d:”,b++);
fflush(stdin);
scanf(“%f”,&a[i][j]);
}
}
}
printf(“\nThe Matrix is:\n”);
for(i=1;i<=n;i++)
{
for(j=1;j<=(n+1);j++)
{
if(j!=4)
printf(“%7.2f\t”,a[i][j]);
else
printf(“|%7.2f”,a[i][j]);
}
printf(“\n”);
}
for(i=1;i<=(n-1);i++)
{
/*m=fabs(a[i][i]);
p=i;
for(l=(i+1);l<=n;l++)
{
if((fabs(a[l][i]))>m)
{
m=fabs(a[l][i]);
p=l;
}
}
if(p!=i)
{
for(q=i;q<=(n+1);q++)
{
temp=a[i][q];
a[i][q]=a[p][q];
a[p][q]=temp;
}
}*/
for(j=(i+1);j<=n;j++)
{
t=(a[j][i])/(a[i][i]);
for(k=i;k<=(n+1);k++)
a[j][k]=a[j][k]-(t*a[i][k]);
}
}
x[n]=(a[n][n+1]/a[n][n]);
for(i=(n-1);i>=1;i–)
{
sum=0;
for(j=(i+1);j<=n;j++)
sum=sum+(a[i][j]*x[j]);

x[i]=(a[i][n+1]-sum)/a[i][i];
}
printf(“\nSolution of the Equations”);
for(i=1;i<=n;i++)
printf(“\nX%d=%5.2f”,i,x[i]);
getch();
}