forked from hustcc/JS-Sorting-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.java
More file actions
50 lines (40 loc) · 1.35 KB
/
MergeSort.java
File metadata and controls
50 lines (40 loc) · 1.35 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
import java.util.Arrays;
/**
* 归并排序
*/
public class MergeSort implements IArraySort {
@Override
public int[] sort(int[] sourceArray) throws Exception {
// 对 arr 进行拷贝，不改变参数内容
int[] arr = Arrays.copyOf(sourceArray, sourceArray.length);
if (arr.length < 2) {
return arr;
}
int middle = (int) Math.floor(arr.length / 2);
int[] left = Arrays.copyOfRange(arr, 0, middle);
int[] right = Arrays.copyOfRange(arr, middle, arr.length);
return merge(sort(left), sort(right));
}
protected int[] merge(int[] left, int[] right) {
int[] result = new int[left.length + right.length];
int l = 0, r = 0, len = 0;
while (len < left.length + right.length) {
if (left[l] <= right[r]) {
result[len++] = left[l++];
if (l == left.length) {
for (int i = r; i < right.length; i++) {
result[len++] = right[r++];
}
}
} else {
result[len++] = right[r++];
if (r == right.length) {
for (int i = l; i < left.length; i++) {
result[len++] = left[l++];
}
}
}
}
return result;
}
}