// Copyright 2005 Daniel Cer (daniel.cer@cs.colorado.edu)
//
// This work is licensed under the Creative Commons Attribution-NonCommercial-
// ShareAlike License. To view a copy of this license, visit 
// http://creativecommons.org/licenses/by-nc-sa/2.5/ or send a letter to 
// Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 
// 94105, USA.

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

// bubble_sort - sorts, in place, the items stored in the vector 'entries' 
// 
// notes: the type of the items, T, must support '<'
template <typename T> void bubble_sort(vector<T> &entries) { bool swapped=true;
  for (int i = entries.size()-1; i >= 0 && swapped; i--) 
  for (int j = 0, swapped=false; j < i; j++) {
    if (entries[j+1] < entries[j]) { T swap;
      swap = entries[j+1]; entries[j+1] = entries[j]; entries[j] = swap;
      swapped=true;
    }
  }
}

int main(int argc, char *argv[]) {
  if (argc != 2) {
    cerr<<"Usage:\n\t"<<argv[0]<<" (file with numbers to sort)"<<endl;
    return -1;
  }

  char *file_name = argv[1];
  ifstream istrm(file_name);
  if (!istrm.good()){ cerr<<"Can't open \""<<file_name<<"\"\n"; return -1; }

  // read in the entries 
  vector<float> entries; 
  for (float f; istrm>>f, istrm.good(); ) entries.push_back(f); 
  istrm.close();

  // sort them
  bubble_sort(entries);

  // display the results
  for (vector<float>::iterator iter=entries.begin(); 
       iter != entries.end(); iter++) cout<<*iter<<endl; 
  
  return 0;
}