What is the heap sort algorithm in C++?

Can you explain the heap sort algorithm in C++?

Sure! Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure. It first builds a max heap from the input data, then repeatedly extracts the maximum element from the heap and rebuilds the heap until all elements are sorted.

How do I implement heap sort using the C++ standard library?

You can use the make_heap, pop_heap, and push_heap functions from the <algorithm> header. First, create a heap with make_heap, then use pop_heap to sort the elements.

Can you provide a code example for heap sort?

Certainly! Here's a simple example:

#include <iostream>
#include <algorithm>
#include <vector>

void heapSort(std::vector<int>& arr) {
    std::make_heap(arr.begin(), arr.end());
    std::sort_heap(arr.begin(), arr.end());
}

int main() {
    std::vector<int> arr = {3, 5, 1, 4, 2};
    heapSort(arr);
    for (int num : arr) std::cout << num << " ";
    return 0;
}

What is the time complexity of heap sort?

The time complexity of heap sort is O(n log n) for all cases (best, average, and worst). This makes it efficient for large datasets.