import java.util.*;
/** 
 * Uses Merge sort routine for linked lists
 * @author 
 
 */
public class MergeSort {

  
  
  public static void main(String[] args) {
  
    SimpleLinkedList list = new SimpleLinkedList();
    
    if (args.length == 1) { 
      int numberOfValues = Integer.parseInt(args[0]);
      Random generator = new Random();
      final int MAX = 200;
      for (int i = 0; i < numberOfValues; i++)
        list.addToHead(generator.nextInt(MAX));
      System.out.println("\nUnsorted list: \n" + list);
    
    
    
      long startTime = System.currentTimeMillis();
      list.mergeSort();
      long stopTime = System.currentTimeMillis();
      
      System.out.println("\nSorted list:   \n" + list);
      System.out.println("\nTime to sort " + args[0] + 
                         " random integers in range 1 - 200: " + 
			 (stopTime - startTime) + " ms");
                         
    }
  }
}  

/* SAMPLE OUTPUT:

eos% java MergeSort 5
 
Unsorted list:
[24, 7, 55, 95, 55]
 
Sorted list:
[24, 7, 55, 95, 55]
 
Time to sort 5 random integers in range 1 - 200: 0 ms
*/