Heap Sort

Heap sort is a comparison based sorting algorithm. It is similar to selection sort where we first find the maximum element and place the maximum element at the end. We repeat the same process for remaining element.

Visit the following resources to learn more:

• Heap Sort Algorithm
• Heap Sort Algorithm - Geeks for Geeks
• Heap Sort in 4 Minutes
• Heap Sort Algorithm - MIT
• Heap Sort Algorithm
• Lecture 4 - Heaps and Heap Sort