sort_heap()

#include <algorithm>

void sort_heap (Ran first, Ran last) 
void sort_heap (Ran first, Ran last, Binary comp) 
 
Ran ranges::sort_heap (Range r, Binary comp = {}, proj = {}) 
Ran ranges::sort_heap (Ran first, Ran last, Binary comp = {}, proj = {}) 

Sortiert den als Heap vorgegebenen Bereich [first,last) aufsteigend.

Rückgabewert: keiner bzw. last.

is_heap(), is_sorted(), make_heap(), sort(), stable_sort().

sort_heap.cpp

#include <algorithm>
#include <iostream>
#include <vector>
 
int main()
{
  std::vector<int> v = { 3, 7, 2, 0, 1, 9, 4, 6, 5, 8 };
 
  std::make_heap(begin(v), end(v));
  std::sort_heap(begin(v), end(v));
 
  for(auto e : v) std::cout << e << " "; std::cout << '\n';
}