// A sample program to illustrate basic string operations.      v. 4/12/06
//  - Example using exchange sort as function

#include <iostream>
#include <fstream>
#include <string>

using namespace std;

// Give prototype of sort function
void SortStrings( string X[], int Size );

int main()
{
  string Names[100];  // Assume no more than 100 names in file
  fstream Infile;
  int InCt = 0, i;

  Infile.open( "names.txt", ios::in );

  // Read the file
  while( Infile >> Names[ InCt ] )
    InCt++;  // It would be safer code if we checked to make sure InCt < 100!

  // Print the array (so we can see what's there)
  cout << "Original list" << endl;
  for ( i=0; i<InCt; i++ )
    cout << "  " << Names[i] << endl;

  // Sort it.
  SortStrings( Names, InCt );

  // Print it again (to see what happened)
  cout << endl << "Sorted list" << endl;
  for ( i=0; i<InCt; i++ )
    cout << "  " << Names[i] << endl;

  return 0;
}

// Definition of SortStrings function
void SortStrings( string X[], int Size ) {

  int i, j, minidx;
  string min, temp;

  for ( i=0; i<(Size-1); i++ ) {
    min = X[i];            // Assume min is first name in array
    minidx = i;            // Remember where it is
    for ( j=i+1; j<Size; j++ ) {
      if ( X[j] < min ) {  // Did we locate a lower value?
        min = X[j];
        minidx = j;
      }
    }

    if ( min < X[i] ) {    // Check to see if we have a new minimum
      temp = X[i];         // if so, swap names
      X[i] = min;
      X[ minidx ] = temp;
    }
  }

}