Implement Heap Sort in C++

If you’re in a computer science background, widening your technical horizons is the best thing you should do. However, your programming skills matter the most. And one must continuously keep sharpening these skills, to become a better programmer in the future. Though there are multiple things to focus on, one specific area you must focus on is the world of data structures. Data structures in general are particular approaches to solve problems so that computer resources get used minimum. In general, there are multiple data structures you can learn and implement as well. However, we’ve covered some basic data structures before, so, now we’ll move towards some advanced data structures. Hence, today we’re going to learn how to Implement Heap Sort using C++.


What is Heap Sort?


  • It is a comparison-based sorting algorithm that works on the principles of Binary Heap data structure.


  • The algorithm creates a heap of input elements similar to that of binary trees. Elements are divided into sorted and unsorted heaps.


  • The largest elements are moved from the unsorted heap to the sorted heap. So the smallest element is kept at the top.


  • And this process is repeated further till the entire heap gets sorted.


Also Read: Implement Bubble Sort using C++


What’s The Approach?


  • Firstly we’ll divide our input array into two parts i.e, inside the heapify() function.


  • While doing so, we are going to start from the middle of the input array, and with each iteration, we’re going to decrement the index i by one.


  • While creating heaps, we’ll make sure to keep the largest element as the root (head element).


  • The above two instructions will continue to execute till we reach the starting index of the array.


  • At the end of the heapify() function, use recursion to sort the sub-heaps as well.


C++ Program To Implement Heap Sort



12, 11, 13, 5, 6, 7



Sorted array is 
5 6 7 11 12 13 


// C++ program for implementation of Heap Sort
#include <iostream>
using namespace std;

// To heapify a subtree rooted with node i which is
// an index in arr[]. n is size of heap
void heapify(int arr[], int n, int i)
    int largest = i; // Initialize largest as root
    int l = 2 * i + 1; // left = 2*i + 1
    int r = 2 * i + 2; // right = 2*i + 2

    // If left child is larger than root
    if (l < n && arr[l] > arr[largest])
        largest = l;

    // If right child is larger than largest so far
    if (r < n && arr[r] > arr[largest])
        largest = r;

    // If largest is not root
    if (largest != i) {
        swap(arr[i], arr[largest]);

        // Recursively heapify the affected sub-tree
        heapify(arr, n, largest);

// main function to do heap sort
void heapSort(int arr[], int n)
    // Build heap (rearrange array)
    for (int i = n / 2 - 1; i >= 0; i--)
        heapify(arr, n, i);

    // One by one extract an element from heap
    for (int i = n - 1; i > 0; i--) {
        // Move current root to end
        swap(arr[0], arr[i]);

        // call max heapify on the reduced heap
        heapify(arr, i, 0);

/* A utility function to print array of size n */
void printArray(int arr[], int n)
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    cout << "\n";

// Driver code
int main()
    int arr[] = { 12, 11, 13, 5, 6, 7 };
    int n = sizeof(arr) / sizeof(arr[0]);

    heapSort(arr, n);

    cout << "Sorted array is \n";
    printArray(arr, n);




I'm a coding geek interested in cyberspace who loves to write and read

Leave a Reply

Your email address will not be published. Required fields are marked *