public class MergeSortDemo
1: //MergeSortDemo.java
2:
3: import java.util.Scanner; //added
4:
5: public class MergeSortDemo
6: {
7: public static void main(String[] args)
8: {
9: //int[] anArray = {7, 5, 11, 2, 16, 4, 18, 14, 12, 30};
10: int arraySize = 10 + (int)(6*Math.random()); //added
11: int[] anArray = new int[arraySize]; //added
12: for (int i=0; i<arraySize; i++) //added
13: anArray[i] = 10 + (int)(90*Math.random());//added
14:
15: System.out.println("\nArray values before sorting:");
16:
17: for (int i = 0; i < anArray.length; i++)
18: System.out.print(anArray[i] + " ");
19: System.out.println();
20: Scanner keyboard = new Scanner(System.in); //added
21: System.out.print("Press Enter to continue ... "); //added
22: keyboard.nextLine(); //added
23:
24: MergeSort.sort(anArray);
25:
26: System.out.println("\nArray values after sorting:");
27: for (int i = 0; i < anArray.length; i++)
28: System.out.print(anArray[i] + " ");
29: System.out.println();
30: }
31: }
32: