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.

C(s)C++ Programmer's Reference
C Programming on the IBM PC (C Programmers Reference Guide Series)
ISBN: 0673462897
EAN: 2147483647
Year: 2002
Pages: 539 © 2008-2017.
If you may any questions please contact us: