sort_heap function template — Sorts a heap in place
template<typename RandIter> void sort_heap(RandIter first, RandIter last); template<typename RandIter, typename Compare> void sort_heap(RandIter first, RandIter last, Compare comp);
The sort_heap
function
template sorts a heap in the range [first
, last
). The sort is not stable, so
equivalent elements do not preserve their original order.
The first version compares items using the <
operator. The second version uses
comp(X
, Y)
to test whether X
<
Y
.