Gauss Jecobi program

#include<iostream>
using namespace std;
int main()
{

    int n,i,j,it=0;
    cin>>n;
    float mat[n][n+1],x[50]={0},y[50],sum=0;
    for(i=0;i<n;i++)
    {
        for(j=0;j<n+1;j++)
        {
            cin>>mat[i][j];
        }
    }
    do{

    for(i=0;i<n;i++)
    {
       for(j=0;j<n;j++)
        {
            if(i==j)
            {
                continue;
            }
            else
            {
                sum=sum+mat[i][j]*x[j];
            }
        }
        y[i]=(mat[i][n]-sum)/mat[i][i];
        sum=0;
    }
    for(i=0;i<n;i++)
    {
        x[i]=y[i];
    }
    ++it;
    }while(it<=20);
    for(i=0;i<n;i++)
    {
        cout<<x[i]<<endl;
    }
}








Comments

Popular posts from this blog

bairstow method code

Optimal page replacement algorithm in c++