-
Notifications
You must be signed in to change notification settings - Fork 14
/
heap_sort.js
55 lines (42 loc) · 978 Bytes
/
heap_sort.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
/**
* Implementation Of Heap Sort
* Example :
* Input => [60, 20, 35, 32, 100, 69, 42, 58]
* Output => [
20, 32, 35, 42,
58, 60, 69, 100
]
*/
let arrayLength = 0;
function heapRoot(input, i) {
const left = 2 * i + 1;
const right = 2 * i + 2;
let max = i;
if (left < arrayLength && input[left] > input[max]) {
max = left;
}
if (right < arrayLength && input[right] > input[max]) {
max = right;
}
if (max !== i) {
swap(input, i, max);
heapRoot(input, max);
}
}
function swap(input, indexA, indexB) {
[input[indexA], input[indexB]] = [input[indexB], input[indexA]];
}
function heapSort(input) {
arrayLength = input.length;
for (let i = Math.floor(arrayLength / 2); i >= 0; i -= 1) {
heapRoot(input, i);
}
for (let i = input.length - 1; i > 0; i--) {
swap(input, 0, i);
arrayLength--;
heapRoot(input, 0);
}
}
const arr = [60, 20, 35, 32, 100, 69, 42, 58];
heapSort(arr);
console.log(arr);