﻿ C++ : Sort an array using the Heap sort algorithm

# C++ Heapsort sort algorithm Exercise: Sort an array of elements using the Heapsort sort algorithm

## C++ Sorting: Exercise-8 with Solution

Write a C++ program to sort an array of elements using the Heapsort sort algorithm.

Sample Solution:

C++ Code :

``````// Including necessary C++ libraries
#include <algorithm>
#include <iterator>
#include <iostream>

// Function to perform heap sort algorithm
template<typename RandomAccessIterator>
void heap_sort(RandomAccessIterator begin, RandomAccessIterator end) {
// Creating a heap from the elements in the range [begin, end)
std::make_heap(begin, end);

// Sorting the heap by repeatedly extracting the maximum element
std::sort_heap(begin, end);
}

// Main function
int main() {
// Initializing an array of integers for sorting
int a[] = {125, 0, 695, 3, -256, -5, 214, 44, 55};

// Displaying the original numbers in the array
std::cout << "Original numbers:\n";
std::copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
std::cout << "\n";

// Sorting the array using heap_sort function
heap_sort(std::begin(a), std::end(a));

// Displaying the sorted numbers after heap sort
std::cout << "Sorted numbers:\n";
std::copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
std::cout << "\n";

// Returning 0 to indicate successful execution
return 0;
}
``````

Sample Output:

```Original numbers:
125 0 695 3 -256 -5 214 44 55
Sorted numbers:
-256 -5 0 3 44 55 125 214 695
```

Flowchart:

C++ Code Editor: