sort_heap [C++ Reference]
Keywords: stl,algorithm,sort_heap
Date: 2009-10-09T02:10:29-0700

[[sort_heap]]
C++ Reference
Translations of this page?:

- en
- br-pt
- cn
- fr
- it
- jp
- pl
- ru
- tr

## sort_heap

Syntax:

        #include <algorithm>
        void sort_heap( random_iterator start, random_iterator end );
        void sort_heap( random_iterator start, random_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

Edit this page • Old revisions
• • • Login • Index • Recent changes • RSS • cc •