MultiThreaded-MergeSort/Assignment1.java at master · esleytel22/MultiThreaded-MergeSort · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
importjava.util.Arrays;
publicclassAssignment1
{
publicstaticvoidmain(String[] args)
	{
Integer[] array = newInteger[100];

for (inti = 0; i < 100; i++)
 {
array[i] = (int) (Math.random() * ((10000 - 1) + 1)) + 1;
 }

System.out.println("Original Unsorted Order: " + Arrays.toString(array));

MergeSort<Integer> merge = newMergeSort<Integer>(array);


merge.start();


try {
merge.join();

 } catch (InterruptedExceptionie) {
ie.printStackTrace();

 }

merge.getSortedValues(array);
System.out.println("Sorted Order: " + Arrays.toString(array));
	}

}