Algorithms: Heap Sort – featuring Min and Max Heap (JavaScript)




I explain and code the Heap Sort algorithm and the Heap data structure in JavaScript.

Final code can be found here: https://gist.github.com/Shaddyjr/f46a0beb89d1f1517c1c9ce6d5bf6601

As a way to improve my coding skills and technical interview prep, I practice HackerRank problems and solve them live with minimal edits. This allows viewers to see my thought process and problem-solving techniques along with the true struggles I go through when solving these technical coding problems. I also delve into tutorials about building out data structures and algorithms.

I mainly code in JavaScript and Python. I also try to focus on Easy and Medium difficulty HackerRank problems, but occasionally detour onto other challenges, like those from my own technical interviews, daily coding challenges, or just fun coding puzzles I come across.

Original source


One response to “Algorithms: Heap Sort – featuring Min and Max Heap (JavaScript)”

Leave a Reply