d7r8.cpp

Visual C++ 常用数值算法集 源代码

#include "iostream.h"
#include "fstream.h"
#include "stdlib.h"
#include "string.h"
#include "conio.h"

void main()
{
    //program d7r8
    //driver for routine rank
    double a[101], b[11];
	int indx[101], irank[101];
	int i,j,l,k;
	ifstream fin;
	fin.open("d:\\vc常用数值算法集\\data\\tarray.dat",ios::in|ios::nocreate);
	if (!fin)
	{
		cerr<<"could not open d:\\vc常用数值算法集\\data\\tarray.dat"<<endl;
		exit(1);
	}
	for (i=1; i<=100; i++)
	{
		fin>>a[i];
	}
	fin.close();
    indexx(100, a, indx);
    rank(100, indx, irank);
	cout<<endl;
    cout<<"Original array:"<<endl;
    for (i = 1; i<=10; i++)
	{
        for (j = 1; j<=10; j++)
		{
			cout.width(7);
			cout.setf(ios::left);
            cout<<a[10 * (i - 1) + j];
        }
        cout<<endl;
    }
	cout<<endl;
    cout<<"Table of ranks is:"<<endl;
    for (i = 1; i<=10; i++)
	{
        for (j = 1; j<=10; j++)
		{
			cout.width(7);
			cout.setf(ios::left);
            cout<<irank[10 * (i - 1) + j];
        }
        cout<<endl;
    }
    cout<<"press any key to continue..."<<endl;
    getch();
    cout<<"Array sorted according to rank table:"<<endl;
    for (i = 1; i<=10; i++)
	{
        for (j = 1; j<=10; j++)
		{
            k = 10 * (i - 1) + j;
            for (l = 1; l<=100; l++)
			{
                if (irank[l] == k)
				{
					b[j] = a[l];
				}
            }
        }
        for (j = 1; j<=10; j++)
		{
			cout.width(7);
			cout.setf(ios::left);
            cout<<b[j];
        }
        cout<<endl;
    }
}