-
Notifications
You must be signed in to change notification settings - Fork 52
Expand file tree
/
Copy pathMergeSort.java
More file actions
76 lines (54 loc) · 1.23 KB
/
MergeSort.java
File metadata and controls
76 lines (54 loc) · 1.23 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
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
void merge(int a[], int l, int mid, int r) {
int n1 = mid - l + 1;
int n2 = r - mid;
int left[] = new int[n1];
int right[] = new int[n2];
for (int i = 0; i < n1; ++i)
left[i] = a[l + i];
for (int j = 0; j < n2; ++j)
right[j] = a[mid + 1 + j];
int i = 0, j = 0;
int k = l;
while (i < n1 && j < n2) {
if (left[i] <= right[j]) {
a[k] = left[i++];
} else {
a[k] = right[j++];
}
k++;
}
while (i < n1) {
a[k++] = left[i++];
}
while (j < n2) {
a[k++] = right[j++];
}
}
void sort(int a[], int left, int right) {
int mid = 0;
if (left < right) {
mid = left + ((right - left) >> 1);
sort(a, left, mid);
sort(a, mid + 1, right);
merge(a, left, mid, right);
}
}
static void printArray(int a[]) {
System.out.println(Arrays.toString(a));
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int numberOfElements = sc.nextInt();
int a[] = new int[numberOfElements];
for (int i = 0; i < numberOfElements; i++) {
a[i] = sc.nextInt();
}
Solution object = new Solution();
object.sort(a, 0, numberOfElements - 1);
printArray(a);
sc.close();
}
}