Heap Sort Program in C - Understanding the Heap Sort Algorithm

Watch Great Learning’s video on the HeapSort Algorithm Using C! HeapSort Algorithm, invented by J. W. J. Williams, in 1964, is one of the most efficient sorting algorithms and is a comparison-based sorting technique. HeapSort is based on binary heap data structure and is very much similar to how selection sort works, where the maximum element is found first, which is then placed at the end. The same process is then repeated for the remaining elements.

Great Learning brings you this video “HeapSort Algorithm Using C”, which aims at helping you understand this specific type of algorithm. We start off by understanding what HeapSort is followed by understanding its step-by-step approach. This video will help you understand the implementation of HeapSort algorithms and will also take you through HeapSort Time/Space Complexity. Added to this, the video teaches these concepts by carrying out simultaneous demonstrations as well as examples of HeapSort algorithms.

Introduction.
Agenda.
What is HeapSort?.
HeapSort - Step-by-step.
HeapSort - Demonstration.
HeapSort - Algorithm.
HeapSort - Implementation.
HeapSort - Time Complexity.
HeapSort - Space Complexity.