import structure.*;
import com.mw.io.*;
import VectorMergeSort;
import java.util.Random;

class sortDriver2 {
// A program that generates a list of n random numbers, calls
// a sorting routine, displays the result and the elapsed
// time in milliseconds for the sort.

    static void displayList(Vector data) {
      for (int i=0; i<data.size(); i++) {
         System.out.print(((ComparableInt)data.elementAt(i)) + "  ");
         if (i % 10 == 9)
            System.out.println();
      }
      System.out.println();
    }
    
    public static void main (String args[]) {
      SystemInput sysIn = new SystemInput(); 
      Vector data = new Vector(2000);    // capacity is 2000 integers

      Random X = new Random();           // X is a series of random numbers with seed == 0;
      X.setSeed(0);                      // this series repeats for different program runs
       
      ReadStream r = new ReadStream();
      System.out.println("Enter an integer");
      int n = r.readInt();

        for (int i=0; i<n; i++)
          data.insertElementAt(new ComparableInt(Math.abs(X.nextInt() % 1000)), i);  // get next random number modulo 1000
        System.out.println("The first " + n + 
            " random numbers are: ");
        displayList(data);

        long t = System.currentTimeMillis();
        VectorMergeSort.mergeSort(data, data.size()); // pick one of these sorts and comment 
//      VectorHeapSort.heapSort(data, data.size());   // out the other
        long u = System.currentTimeMillis();

        System.out.println("The sorted numbers are: ");
        displayList(data);       
        System.out.println("Elapsed sorting time = " + (u - t) + " milliseconds");
    }
}