d9r3.cpp

《VC++ 常用数值算法》代码

#include "iostream.h"

void main()
{
    //program d9r3
    //driver for routine covsrt
    int i,j,ma = 10;
    int mfit = 5;
    double covar[101];
	int lista[6];
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            covar[(i-1)*ma+j] = 0.0;
            if (i <= 5 && j <= 5)
			{
                covar[(i-1)*ma+j] = i + j - 1;
            }
        }
    }
    cout<<"Original matrix"<<endl;
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            cout<<covar[(i-1)*ma+j]<<"    "; 
        }
		cout<<endl;
    }
    //test 1 - spread by 2
    cout<<"test #1 - spread by two"<<endl;
    for (i = 1; i<=mfit; i++)
	{
        lista[i] = 2 * i;
    }
    covsrt(covar, ma, ma, lista, mfit);
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            cout<<covar[(i-1)*ma+j]<<"    "; 
        }
		cout<<endl;
    }
    //test 2 - reverse
    cout<<"test #2 - reverse"<<endl;
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            covar[(i-1)*ma+j] = 0.0;
            if (i <= 5 && j <= 5)
			{
                covar[(i-1)*ma+j] = i + j - 1;
            }
        }
    }
    for (i = 1; i<=mfit; i++)
	{
        lista[i] = mfit + 1 - i;
    }
    covsrt(covar, ma, ma, lista, mfit);
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            cout<<covar[(i-1)*ma+j]<<"    "; 
        }
		cout<<endl;
    }
    //test 3 - spread and reverse
    cout<<"test #3 - spread and reverse"<<endl;
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            covar[(i-1)*ma+j] = 0.0;
            if (i <= 5 && j <= 5)
			{
                covar[(i-1)*ma+j] = i + j - 1;
            }
        }
    }
    for (i = 1; i<=mfit; i++)
	{
        lista[i] = ma + 2 - 2 * i;
    }
    covsrt(covar, ma, ma, lista, mfit);
    for (i = 1; i<=ma; i++)
	{
        for (j = 1; j<=ma; j++)
		{
            cout<<covar[(i-1)*ma+j]<<"    "; 
        }
		cout<<endl;
    }
}