cppreference.com > C++ Algorithms > sort_heap sort_heap Syntax:
      #include <algorithm>
      void sort_heap( iterator start, iterator end );
      void sort_heap( iterator start, iterator end, StrictWeakOrdering cmp );
The sort_heap() function turns the heap defined by [start,end) into a sorted range. If the strict weak ordering comparison function object cmp is given, then it is used instead of the < operator to compare elements. Related topics: is_heap make_heap pop_heap push_heap