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 = {27, 10, 12, 20, 25, 13, 15, 22};
10: //int[] anArray = {7, 5, 11, 2, 16, 4, 18, 14, 12, 30};
11: //int[] anArray = {56, 27, 42, 26, 69, 92, 28, 14, 40, 91, 63, 55, 89};
12: //int[] anArray = {10, 67, 17, 52, 36, 41, 94, 69, 95, 67};
13: int arraySize = 10 + (int)(6*Math.random()); //added
14: int[] anArray = new int[arraySize]; //added
15: for (int i=0; i<arraySize; i++) //added
16: anArray[i] = 10 + (int)(90*Math.random());//added
17: /*
18: */
19:
20: System.out.println("\nArray values before sorting:");
21:
22: for (int i = 0; i < anArray.length; i++)
23: System.out.print(anArray[i] + " ");
24: System.out.println();
25: Scanner keyboard = new Scanner(System.in); //added
26: System.out.print("Press Enter to continue ... "); //added
27: keyboard.nextLine(); //added
28:
29: MergeSort.mergeSort(anArray);
30:
31: System.out.println("\nArray values after sorting:");
32: for (int i = 0; i < anArray.length; i++)
33: System.out.print(anArray[i] + " ");
34: System.out.println();
35: }
36: }
37: