-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathMerge_Sort.js
More file actions
53 lines (46 loc) · 1.05 KB
/
Copy pathMerge_Sort.js
File metadata and controls
53 lines (46 loc) · 1.05 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
const merge = (arr, l, m, r) => {
let n1 = m - l + 1;
let n2 = r - m;
let L = new Array(n1);
let R = new Array(n2);
// Copy left half to L array
for (let i = 0; i < n1; i++)
L[i] = arr[l + i];
// Copy right half to R array
for (let j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
let i = 0,
j = 0;
let k = l;
// Overwrite elements in original array in the right order
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}
// Copy remaining elements in L, if exist
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
// Copy remaining elements in R, if exist
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
const Merge_Sort = (arr, l, r) => {
if (l < r) {
let m = l + Math.floor((r - l) / 2);
Merge_Sort(arr, l, m);
Merge_Sort(arr, m + 1, r);
merge(arr, l, m, r);
}
}