std::sort_heap

Non-modifying sequence operations

Batch operations

Search operations Modifying sequence operations Copy operations Swap operations Transformation operations Generation operations Removing operations Order-changing operations Sampling operations

(1) (constexpr since C++20)

(2) (constexpr since C++20)

• The type of *first is not Swappable.

(until C++11)

• RandomIt is not ValueSwappable.
• The type of *first is not MoveConstructible.
• The type of *first is not MoveAssignable.

(since C++11)

• 1 Parameters
• 2 Complexity
• 3 Possible implementation
• 4 Example
• 5 Defect reports
• 6 See also

first, last - the pair of iterators defining the binary heap range of elements to make the sorted range

comp - comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than the second.

The signature of the comparison function should be equivalent to the following:

bool cmp(const Type1& a, const Type2& b);

While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
The types Type1 and Type2 must be such that an object of type RandomIt can be dereferenced and then implicitly converted to both of them.

Type requirements

-RandomIt must meet the requirements of LegacyRandomAccessIterator.

-Compare must meet the requirements of Compare.

template<class RandomIt>
void sort_heap(RandomIt first, RandomIt last)
{
 while (first != last)
 std::pop_heap (first, last--);
}

template<class RandomIt, class Compare>
void sort_heap(RandomIt first, RandomIt last, Compare comp)
{
 while (first != last)
 std::pop_heap (first, last--, comp);
}

#include <algorithm>
#include <iostream>
#include <string_view>
#include <vector>
 
void println(std::string_view fmt, const auto& v)
{
 for (std::cout << fmt; const auto &i : v)
 std::cout << i << ' ';
 std::cout << '\n';
}
 
int main()
{
 std::vector <int> v{3, 1, 4, 1, 5, 9};
 
 std::make_heap (v.begin(), v.end());
 println("after make_heap, v: ", v);
 
 std::sort_heap(v.begin(), v.end());
 println("after sort_heap, v: ", v);
}

after make_heap, v: 9 4 5 1 1 3
after sort_heap, v: 1 1 3 4 5 9

checks if the given range is a max heap
(function template) [edit]

finds the largest subrange that is a max heap
(function template) [edit]

creates a max heap out of a range of elements
(function template) [edit]

removes the largest element from a max heap
(function template) [edit]

adds an element to a max heap
(function template) [edit]

turns a max heap into a range of elements sorted in ascending order
(algorithm function object)[edit]