-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.java
More file actions
55 lines (51 loc) · 1.31 KB
/
MergeSort.java
File metadata and controls
55 lines (51 loc) · 1.31 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
package Sorting;
import Util.Swap;
public class MergeSort {
public static int [] mergeSort(int [] nums){
if (nums.length == 1){
return nums;
}
if(nums.length == 2){
if(nums[1] < nums[0]){
Swap.swap(nums,0,1);
}
return nums;
}
int mid = nums.length / 2;
int [] left = new int [mid];
int [] right = new int [nums.length - mid];
for(int i =0; i <mid; i ++){
left[i] = nums[i];
}
for(int i = mid; i < nums.length; i ++){
right[i-mid] = nums[i];
}
left = mergeSort(left);
right = mergeSort(right);
int p1 = 0, p2 = 0, p3 = 0;
while (p1 < mid && p2 < nums.length - mid){
if(left[p1] < right[p2]){
nums[p3] = left[p1];
p1 += 1;
}
else{
nums[p3] = right[p2];
p2 += 1;
}
p3 += 1;
}
while (p1 < mid){
nums[p3] = left[p1];
p1 += 1;
p3 += 1;
}
while(p2 < nums.length - mid){
nums[p3] = right[p2];
p2 += 1;
p3 += 1;
}
return nums;
}
public static void main(String[] args) {
}
}