Sorting Visualizer
Default
Comparing
Swapping
Pivot
Sorted
Debugger · v1.0
LIVE
1function heapSort(array) {
2 const n = array.length;
3 for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
4 heapify(n, i);
5 }
6 for (let i = n - 1; i > 0; i--) {
7 swap(array, 0, i);
8 heapify(i, 0);
9 }
10 function heapify(N, i) {
11 let largest = i;
12 let left = 2 * i + 1;
13 let right = 2 * i + 2;
14 if (left < N && array[left] > array[largest]) largest = left;
15 if (right < N && array[right] > array[largest]) largest = right;
16 if (largest !== i) {
17 swap(array, i, largest);
18 heapify(N, largest);
19 }
20 }
21}
Debugger · v1.0
LIVE
1function heapSort(array) {
2 const n = array.length;
3 for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
4 heapify(n, i);
5 }
6 for (let i = n - 1; i > 0; i--) {
7 swap(array, 0, i);
8 heapify(i, 0);
9 }
10 function heapify(N, i) {
11 let largest = i;
12 let left = 2 * i + 1;
13 let right = 2 * i + 2;
14 if (left < N && array[left] > array[largest]) largest = left;
15 if (right < N && array[right] > array[largest]) largest = right;
16 if (largest !== i) {
17 swap(array, i, largest);
18 heapify(N, largest);
19 }
20 }
21}
State Inspector
?
No variables in scope.
Size:30
1x
Sorting Visualizer