function.cpp

用doolittle分解法（非选主元）解用户输入的线性方程组。若无法解

#include <iostream.h>
#include <iomanip.h>
double **create(int n)
{
    double **A = new double*[n+1];   
    for(int i= 0;i<=n;i++)   
    A[i]=new double[n+1];
	
	for(i= 1;i<=n;i++)
	{
		for(int j= 1;j<=n;j++)
        cin>>A[i][j]; 
	}
	return A;
}

int destroy(double **p,int n)
{
	for(int i=0;i<=n;i++) 
	{
        delete   p[i];  
	}  
	delete []p;
	return 0;
}
double *createB(int n)
 {
	 double *p=new double[n+1];
	 for(int i= 1;i<=n;i++)   
     cin>>p[i];
	 return p;
 }
 int destroyB(double *p)
 {
	 delete []p;
	 return 0;
 }
int output1(double **p,int n)
{
	cout<<"系数矩阵为:"<<endl;
	for(int i= 1;i<=n;i++)
	{
		for(int j= 1;j<=n;j++)
		{
			cout<<p[i][j]<<setw(6);
			if(j==n) cout<<endl;
		}
	}
	return 0;
}

int output2(double *p,int n)
{
	cout<<"解向量为:"<<endl;
	for(int i= 1;i<=n;i++)
		cout<<p[i]<<setw(12);
	cout<<endl;
	return 0;
}