-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMultiThreadedMergeSort.java
More file actions
96 lines (87 loc) · 2.57 KB
/
MultiThreadedMergeSort.java
File metadata and controls
96 lines (87 loc) · 2.57 KB
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
package interview;
import java.util.Random;
public class MultiThreadedMergeSort {
private static int SIZE = 25;
private int[] input = new int[SIZE];
private int[] scratch = new int[SIZE];
void mergeSort(final int start, final int end, final int[] input) {
if (start == end) {
return;
}
final int mid = start + ((end - start) / 2);
// sort first half
Thread worker1 = new Thread(new Runnable() {
public void run() {
mergeSort(start, mid, input);
}
});
// sort second half
Thread worker2 = new Thread(new Runnable() {
public void run() {
mergeSort(mid + 1, end, input);
}
});
// start the threads
worker1.start();
worker2.start();
try {
worker1.join();
worker2.join();
}
catch (InterruptedException ie) {
// swallow
}
// merge the two sorted arrays
int i = start;
int j = mid + 1;
int k;
for (k = start; k <= end; k++) {
scratch[k] = input[k];
}
k = start;
while (k <= end) {
if (i <= mid && j <= end) {
input[k] = Math.min(scratch[i], scratch[j]);
if (input[k] == scratch[i]) {
i++;
} else {
j++;
}
} else if (i <= mid && j > end) {
input[k] = scratch[i];
i++;
} else {
input[k] = scratch[j];
j++;
}
k++;
}
}
}
class Demonstration {
private static int SIZE = 25;
private static Random random = new Random(System.currentTimeMillis());
private static int[] input = new int[SIZE];
static private void createTestData() {
for (int i = 0; i < SIZE; i++) {
input[i] = random.nextInt(10000);
}
}
static private void printArray(int[] input) {
System.out.println();
for (int i = 0; i < input.length; i++)
System.out.print(" " + input[i] + " ");
System.out.println();
}
public static void main(String args[] ) {
createTestData();
System.out.println("Unsorted Array");
printArray(input);
long start = System.currentTimeMillis();
(new MultiThreadedMergeSort()).mergeSort(0, input.length - 1, input);
long end = System.currentTimeMillis();
System.out.println("\n\nTime taken to sort = " + (end - start) + " milliseconds");
System.out.println("Sorted Array");
printArray(input);
}
}