/***************************************/
/* Karlo V. Miranda                    */
/* ECE 270                             */
/* Homework Project no.3               */
/* Feburary 5, 2001                    */
/***************************************/
/* This Program is a Destructive Sort  */
/* program designed to sort data and   */
/* arrange them in order of increasing */
/* values accordingly.                 */
/*       (Program: hw3.cc)             */
/***************************************/
//
//
/*--------------------------------------------------------------*/
#include <stdiostr.h>
#include <iostream.h>
#include <math.h>
/*--------------------------------------------------------------*/
int main()
{
/*--------------------------------------------------------------*/
/* Initialize Variables:                                        */
/*--------------------------------------------------------------*/
        int i, j, numpts, smallest;
        double input[i], output[j];
        double value[j][i];
//
        cout << "Destructive Sort Program (hw3.cpp)!!!!!!" << endl;
        cout << "Enter Number of points in data file: " << endl;
        cin >> numpts;
/*--------------------------------------------------------------*/
/* Default Input Data Values to Zero: (20x20 Maximum Matrix)    */
/*--------------------------------------------------------------*/
        for (i=0; i < 21; i = i + 1)
           {
                input[i] = 0;
           }
/*--------------------------------------------------------------*/
/* Input Values from Data File:                                 */
/*--------------------------------------------------------------*/
        cout << "Read/Enter Data Values:" << endl;
        for (i=1; i < (numpts + 1); i = i + 1)
           {
                cin << input[i];
                        for (j=1; j < (numpts + 1); j = j + 1)
                           {
                                value[j][i] = input[i];
                           }
           }
/*--------------------------------------------------------------*/
/* Destructive Matrix Sorting Fragment:                         */
/*--------------------------------------------------------------*/
        for (i=1; i < (numpts + 1); i = i + 1)
           {
		value[0][i] = 1000;
           }
/*---*/
        for (j=1; j < (numpts + 1); j = j + 1)
           {
                for (i=1; i < (numpts + 1); i = i + 1)
                   {
			if (value[j][i] < value[j-1][i])
                          {
                            output[j] = value[j][i];
                          }
                   }
/*---*/
                for (i=1; i < (numpts + 1); i = i + 1)
                   {
			if (output[j] == input[i])
                          {
                            for (r=1; r < (numpts + 1); r = r + 1)
                              value[r][i] = 1000;
                          }
                   }
           }
/*--------------------------------------------------------------*/
/* Print Out Output in Ordered Form                             */
/*--------------------------------------------------------------*/
        cout << "Output values in ordered form:" << endl;
        for (j=1; j < (numpts + 1); j = j + 1)
           {
                cout << output[j] << endl;
           }
//      while (!kbhit());
        return 0;
}
/*--------------------- End Program ----------------------------*/
/*--------------------------------------------------------------*/