std::sort_heap (3) - Linux Manuals
Defined in header <algorithm>
template< class RandomIt > (until C++20)
void sort_heap( RandomIt first, RandomIt last );
template< class RandomIt > (since C++20)
constexpr void sort_heap( RandomIt first, RandomIt last ); (1)
template< class RandomIt, class Compare > (until C++20)
void sort_heap( RandomIt first, RandomIt last, Compare comp ); (2)
template< class RandomIt, class Compare > (since C++20)
constexpr void sort_heap( RandomIt first, RandomIt last, Compare comp );
Converts the max heap [first, last) into a sorted range in ascending order. The resulting range no longer has the heap property.
The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.
first, last - the range of elements to sort
comp - 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
RandomIt must meet the requirements of ValueSwappable and LegacyRandomAccessIterator.
The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
At most 2×N×log(N) comparisons where N=std::distance(first, last).
A max heap is a range of elements [f,l) that has the following properties:
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR Applied to Behavior as published Correct behavior
LWG_2444 C++98 complexity requirement was wrong by a factor of 2 corrected
// Run this code
make_heap (function template)