#include <iostream.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include "MinHeap.h"
#include "p4sortCompare.h"

int main(int argc, char * argv[])
{
  // Holder for numbers from input
  int num;

  // Construct a priority queue
  MinHeap<int, less_int> pq;

  // Check the arguments.
  //
  // If there is an argument, assume that it's a number and that it
  // indicates a number of random values to generate and sort. 
  //
  // If there is no argument, assume that the user will provide
  // numbers, terminating with a 0 or end of file, from standard
  // input.
  if (argc > 2) {
    // Error: give usage message.
    cerr << "Usage: sort [n]\nIf you supply n, sorts n random values.\n" 
	    << "If you do not supply n, sorts numbers from standard input,\n"
	    << "terminates on a 0 or an end of file." << endl;
    exit(1);
  }
  else if (argc == 2) {
    // Generate random numbers to put in the queue
    int numToGenerate = atoi(argv[1]);

    // Seed the random number generator
    srandom(time(NULL) + getpid());

    // Put in some numbers
    for (int i = 0; i < numToGenerate; i++) {
	 // Modding by numToGenerate keeps them in a reasonable range.
      int x = random() % numToGenerate;
      cout << "Inserting " << x << endl;
      pq.insert(x);
    }
  }
  else {
    // Read numbers from standard input until you read a 0.
    while (cin >> num && num != 0) {
	 pq.insert(num);
    }
  }

  // Print out each number from the priority queue in increasing
  // order. (How would we get decreasing order?)
  while (!pq.isEmpty()) {
    int i;
    pq.deleteMin(i);
    cout << i << " ";
  }
  cout << endl;
  return 0;
}