{"id":9193,"date":"2025-08-10T23:22:11","date_gmt":"2025-08-10T17:52:11","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=9193"},"modified":"2025-10-15T17:38:53","modified_gmt":"2025-10-15T12:08:53","slug":"heap-sort-code","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/heap-sort-code\/","title":{"rendered":"Heap Sort Code"},"content":{"rendered":"\n\n<!-- heap code 6 -->\n<!-- Prism.js for Code Highlighting -->\n<link\n    href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\"\n    rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n          <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n\n    <div class=\"wp_blog_explanation\">\n        <h2>Heap Sort Algorithm<\/h2>\n        <p><code>arr = [4, 10, 3, 5, 1]<\/code> <\/p>\n            <p><strong>No Extra Space: O(1)<\/strong><\/p>\n        <p><strong>Visual Representation<\/strong><\/p>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-10-at-9.12.21\u202fPM.png\" alt=\"\">\n        <ul>\n            <li><code>The steps are as follows:<\/code>\n                <ul>\n                    <li>Create <code>Max Heap<\/code>.\n                       <ul>\n                        <li>Ignore the <strong>leaf nodes<\/strong>.<\/li>\n                        <li><strong>Run Loop<\/strong> in <code>Reverse<\/code>.<\/li>\n                        <li>For each node we create it a <code>maxHeap<\/code>.<\/li>\n                       <\/ul>\n                    <\/li>\n\n                    <li><strong>Sort<\/strong>\n                    <ul>\n                        <li>Extract <code>maximum<\/code> element.<\/li>\n                        <li>Store at end.<\/li>\n                        <li><code>HeapifyDown<\/code><\/li>\n                        <li>Repeat till whole array is <code>sorted<\/code>.<\/li>\n                    <\/ul>\n                    <\/li>\n                <li><strong><code>Output: arr = [1, 4, 3, 5, 10]<\/code><\/strong><\/li>\n                <\/ul>\n            <\/li>\n        <\/ul>\n\n                <h2>Code<\/h2>\n<div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n<pre>\n    let arr = [10, 4, 5, 1, 3];\n    function heapSort(arr) {\n    let n = arr.length;\n        \/\/ create a MaxHeap\n        for(let i=n-1; i >= 0; i--){\n            heapifyDown(arr, i, n);\n        }\n        \/\/ sort the array\n        for(let i = n-1; i > 0; i--) {\n            [arr[0], arr[i]] = [arr[i], arr[0]];\n            heapifyDown(arr, 0, i);\n        }\n        return arr\n      }\n      function heapifyDown(arr, i, n){\n        let largest = i;\n        let left = (2 * i) + 1;\n        let right = (2 * i) + 2;\n\n        if(left < n &#038;&#038; arr[left] > arr[largest]) {\n            largest = left;\n        }\n                \n        if(right < n &#038;&#038; arr[right] > arr[largest]) {\n            largest = right;\n        }\n\n        if(largest != i){\n            [arr[i], arr[largest]] = [arr[largest], arr[i]];\n            heapifyDown(arr, largest, n);\n          }\n        }\n\n        const sortedArray = heapSort(arr);\n        console.log(sortedArray);\n        <\/pre>\n<\/div>\n\n\n\n<h2>Dry Run<\/h2>\n<div style=\"border-left: 4px solid var(--primary); padding: 1rem; border-radius: var(--tab-radius); margin: 1rem 0;\">\n\n  <!-- Initial Heap Creation -->\n  <p><strong>Input:<\/strong><\/p>\n  <pre>Initial array = [10, 4, 5, 1, 3]  \nOperation = Build Max Heap<\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre>\ni = 4 \u2192 left=9, right=10 \u2192 no change \u2192 [10, 4, 5, 1, 3]\ni = 3 \u2192 left=7, right=8 \u2192 no change \u2192 [10, 4, 5, 1, 3]\ni = 2 \u2192 left=5, right=6 \u2192 no change \u2192 [10, 4, 5, 1, 3]\ni = 1 \u2192 left=3, right=4 \u2192 compare arr[3]=1, arr[4]=3 \u2192 largest=4 \u2192 swap \u2192 [10, 3, 5, 1, 4]\ni = 4 heapifyDown: no change \u2192 [10, 3, 5, 1, 4]\ni = 0 \u2192 left=1 (3), right=2 (5) \u2192 largest=2 \u2192 swap \u2192 [5, 3, 10, 1, 4]\nheapifyDown(2): no change \u2192 [5, 3, 10, 1, 4]<\/pre>\n\n  <p><strong>Final Output:<\/strong> <code>[5, 3, 10, 1, 4]<\/code><\/p>\n  <p><strong>Final State:<\/strong> <code>Max Heap = [5, 3, 10, 1, 4]<\/code><\/p>\n\n  <!-- Sorting Phase: Step 1 -->\n  <p><strong>Input:<\/strong><\/p>\n  <pre>Heap = [5, 3, 10, 1, 4]  \nSwap max with last element<\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre>\nSwap arr[0] with arr[4] \u2192 [4, 3, 10, 1, 5]\nheapifyDown(0, n=4): left=1 (3), right=2 (10) \u2192 largest=2 \u2192 swap \u2192 [10, 3, 4, 1, 5]\nheapifyDown(2, n=4): no change<\/pre>\n\n  <p><strong>Final Output:<\/strong> <code>[10, 3, 4, 1, 5]<\/code><\/p>\n  <p><strong>Final State:<\/strong> <code>Heap after 1st extraction<\/code><\/p>\n\n  <!-- Sorting Phase: Step 2 -->\n  <p><strong>Input:<\/strong><\/p>\n  <pre>Heap = [10, 3, 4, 1, 5]  \nSwap max with last element in heap size 4<\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre>\nSwap arr[0] with arr[3] \u2192 [1, 3, 4, 10, 5]\nheapifyDown(0, n=3): left=1 (3), right=2 (4) \u2192 largest=2 \u2192 swap \u2192 [4, 3, 1, 10, 5]\nheapifyDown(2, n=3): no change<\/pre>\n\n  <p><strong>Final Output:<\/strong> <code>[4, 3, 1, 10, 5]<\/code><\/p>\n  <p><strong>Final State:<\/strong> <code>Heap after 2nd extraction<\/code><\/p>\n\n  <!-- Sorting Phase: Step 3 -->\n  <p><strong>Input:<\/strong><\/p>\n  <pre>Heap = [4, 3, 1, 10, 5]  \nSwap max with last element in heap size 3<\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre>\nSwap arr[0] with arr[2] \u2192 [1, 3, 4, 10, 5]\nheapifyDown(0, n=2): left=1 (3), right=2 (out of range) \u2192 largest=1 \u2192 swap \u2192 [3, 1, 4, 10, 5]\nheapifyDown(1, n=2): no change<\/pre>\n\n  <p><strong>Final Output:<\/strong> <code>[3, 1, 4, 10, 5]<\/code><\/p>\n  <p><strong>Final State:<\/strong> <code>Heap after 3rd extraction<\/code><\/p>\n\n  <!-- Sorting Phase: Step 4 -->\n  <p><strong>Input:<\/strong><\/p>\n  <pre>Heap = [3, 1, 4, 10, 5]  \nSwap max with last element in heap size 2<\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre>\nSwap arr[0] with arr[1] \u2192 [1, 3, 4, 10, 5]\nheapifyDown(0, n=1): no change<\/pre>\n\n  <p><strong>Final Output:<\/strong> <code>[1, 3, 4, 10, 5]<\/code><\/p>\n  <p><strong>Final State:<\/strong> <code>Fully Sorted Array<\/code><\/p>\n\n<\/div>\n\n\n\n    <\/div>\n<\/div>\n\n\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Heap Sort Algorithm arr = [4, 10, 3, 5, 1] No Extra Space: O(1) Visual Representation The steps are as follows: Create Max Heap. Ignore the leaf nodes. Run Loop in Reverse. For each node we create it a maxHeap. Sort Extract maximum element. Store at end. HeapifyDown Repeat till whole array is sorted.<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[322,176,175,211,174,172,173],"tags":[],"class_list":["post-9193","post","type-post","status-publish","format-standard","category-algorithms-and-data-structures","category-csharp","category-cplusplus","category-data-structures","category-java","category-javascript","category-python"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9193","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=9193"}],"version-history":[{"count":3,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9193\/revisions"}],"predecessor-version":[{"id":10344,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9193\/revisions\/10344"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=9193"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=9193"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=9193"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}