Title: Heap Sort in JavaScript - Runnable Code Snippet
Open Graph Title: Heap Sort in JavaScript - Runnable Code Snippet
X Title: Heap Sort in JavaScript - Runnable Code Snippet
Description: Sort an array using the heap sort algorithm with O(n log n) time complexity. Runnable JavaScript snippet with live execution.
Open Graph Description: Sort an array using the heap sort algorithm with O(n log n) time complexity. Runnable JavaScript snippet with live execution.
X Description: Sort an array using the heap sort algorithm with O(n log n) time complexity. Runnable JavaScript snippet with live execution.
Keywords:
Opengraph URL: https://tempercode.dev/snippets/heap-sort-javascript
Domain: tempercode.dev
{"@context":"https://schema.org","@type":"SoftwareSourceCode","name":"Heap Sort","description":"Sort an array using the heap sort algorithm with O(n log n) time complexity.","programmingLanguage":"JavaScript","text":"const a = [...arr];\nconst heapify = (n, i) => {\n let largest = i, l = 2 * i + 1, r = 2 * i + 2;\n if (l < n && a[l] > a[largest]) largest = l;\n if (r < n && a[r] > a[largest]) largest = r;\n if (largest !== i) { [a[i], a[largest]] = [a[largest], a[i]]; heapify(n, largest); }\n};\nfor (let i = Math.floor(a.length / 2) - 1; i >= 0; i--) heapify(a.length, i);\nfor (let i = a.length - 1; i > 0; i--) { [a[0], a[i]] = [a[i], a[0]]; heapify(i, 0); }\nreturn a;"}
| theme-color | #0c0d12 |
| color-scheme | dark |
| author | Temper |
| creator | Temper |
| publisher | Temper |
| og:image | https://tempercode.dev/og-image.png |
| og:type | article |
| twitter:card | summary_large_image |
| twitter:image | https://tempercode.dev/og-image.png |
Links:
Viewport: width=device-width, initial-scale=1