stl:algorithm:sort_heap

C++ Reference

previous page next page

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

previous page start next page