stable_sort

sort_heap

template <class RandIter>    void sort_heap(RandIter start, RandIter end); template <class RandIter, class Comp>     void sort_heap(RandIter start, RandIter end, Comp cmpfn); 

The sort_heap( ) algorithm sorts a heap within the range specified by start and end.

The second form allows you to specify a comparison function that determines when one element is less than another.