-
Notifications
You must be signed in to change notification settings - Fork 0
/
mergeLLSort.js
73 lines (63 loc) · 1.41 KB
/
mergeLLSort.js
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
const linkedList = require("./linkedList");
const mergeSort = (list, rev = false) => {
if (list.sizeOf() <= 1) {
return list;
} else if (list.head === undefined) {
return list;
}
let { leftHalf, rightHalf } = divide(list);
let left = mergeSort(leftHalf, rev);
let right = mergeSort(rightHalf, rev);
return sort(left, right, rev);
};
const divide = (list) => {
const mid = Math.floor(list.sizeOf() / 2);
const leftHalf = list.slice(0, mid);
const rightHalf = list.slice(mid);
return { leftHalf, rightHalf };
};
const sort = (arg1, arg2, rev) => {
let newList = new linkedList();
left = arg1.head;
right = arg2.head;
if (rev) {
while (left && right) {
if (left.data > right.data) {
newList.append(left.data);
left = left.nextNode;
} else {
newList.append(right.data);
right = right.nextNode;
}
}
while (left) {
newList.append(left.data);
left = left.nextNode;
}
while (right) {
newList.append(right.data);
right = right.nextNode;
}
return newList;
} else {
while (left && right) {
if (left.data < right.data) {
newList.append(left.data);
left = left.nextNode;
} else {
newList.append(right.data);
right = right.nextNode;
}
}
while (left) {
newList.append(left.data);
left = left.nextNode;
}
while (right) {
newList.append(right.data);
right = right.nextNode;
}
return newList;
}
};
module.exports = mergeSort;