Heap Sort Visualizer — Step-by-Step Interactive Animation

Watch Heap Sort in action step-by-step. Uses a binary heap to sort elements. Always O(n log n) but not stable.

How to Use the Heap Sort Visualizer

  1. Click Play to start the animation or use Step Forward for manual control.
  2. Adjust the speed slider to slow down or speed up the visualization.
  3. Use Custom Input to visualize with your own data.
  4. Click Code to view the implementation in JavaScript, Python, Java, C, or C++.

Explore More Algorithms

  • Bubble Sort Visualizer
  • Selection Sort Visualizer
  • Insertion Sort Visualizer
  • Merge Sort Visualizer
  • Quick Sort Visualizer
  • Radix Sort Visualizer
  • Linear Search Visualizer
  • Binary Search Visualizer

Back to DevVizor Home | All Algorithms | Code Playground