import java.io.*;
import com.mw.io.*;
import java.util.*;
import BubbleSort;
import MergeSort;

class sortDriver {
// 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(int data[], int n) {
      for (int i=0; i<n; i++) {
         System.out.print(data[i] + "  ");
         if (i % 10 == 9)
            System.out.println();
      }
      System.out.println();
    }
    
    public static void main (String args[]) {
      SystemInput sysIn = new SystemInput(); 
      int data[] = new int[2000];        // array 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[i] = Math.abs(X.nextInt() % 1000);  // get next random number modulo 1000
        System.out.println("The first " + n + 
            " random numbers are: ");
        displayList(data, n);

        long t = System.currentTimeMillis();
//      MergeSort.mergeSort(data, n);            // pick one of these sorts and comment 
        BubbleSort.bubbleSort(data, n);          // out the other
        long u = System.currentTimeMillis();

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