//MergeSortDemo.java

import java.util.Scanner; //added

public class MergeSortDemo
{
    public static void main(String[] args)
    {
        //int[] anArray = {27, 10, 12, 20, 25, 13, 15, 22};
        //int[] anArray = {7, 5, 11, 2, 16, 4, 18, 14, 12, 30};
        //int[] anArray = {56, 27, 42, 26, 69, 92, 28, 14, 40, 91, 63, 55, 89};
        //int[] anArray = {10, 67, 17, 52, 36, 41, 94, 69, 95, 67};
        int arraySize = 10 + (int)(6*Math.random());  //added
        int[] anArray = new int[arraySize];           //added
        for (int i=0; i<arraySize; i++)               //added
            anArray[i] = 10 + (int)(90*Math.random());//added
        /*
        */
        
        System.out.println("\nArray values before sorting:");
       
        for (int i = 0; i < anArray.length; i++)
            System.out.print(anArray[i] + " ");
        System.out.println();
        Scanner keyboard = new Scanner(System.in);        //added
        System.out.print("Press Enter to continue ... "); //added
        keyboard.nextLine();                              //added
        
        MergeSort.mergeSort(anArray);
        
        System.out.println("\nArray values after sorting:");
        for (int i = 0; i < anArray.length; i++)
            System.out.print(anArray[i] + " ");
        System.out.println();
    }
}