
ALINK="#ff0000">
sort_heap
PrototypeSort_heap is an overloaded name; there are actually two sort_heap functions.template <class RandomAccessIterator> void sort_heap(RandomAccessIterator first, RandomAccessIterator last); template <class RandomAccessIterator, class StrictWeakOrdering> void sort_heap(RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp); DescriptionSort_heap turns a heap [1] [first, last) into a sorted range. Note that this is not a stable sort: the relative order of equivalent elements is not guaranteed to be preserved.The two versions of sort_heap differ in how they define whether one element is less than another. The first version compares objects using operator<, and the second compares objects using a function object comp. DefinitionDefined in the standard header algorithm, and in the nonstandard backwardcompatibility header algo.h.Requirements on typesFor the first version, the one that takes two arguments:
PreconditionsFor the first version, the one that takes two arguments:
ComplexityAt most N * log(N) comparisons, where N is last  first.Exampleint main() { int A[] = {1, 4, 2, 8, 5, 7}; const int N = sizeof(A) / sizeof(int); make_heap(A, A+N); copy(A, A+N, ostream_iterator<int>(cout, " ")); cout << endl; sort_heap(A, A+N); copy(A, A+N, ostream_iterator<int>(cout, " ")); cout << endl; } Notes[1] A heap is a particular way of ordering the elements in a range of Random Access Iterators [f, l). The reason heaps are useful (especially for sorting, or as priority queues) is that they satisfy two important properties. First, *f is the largest element in the heap. Second, it is possible to add an element to a heap (using push_heap), or to remove *f, in logarithmic time. Internally, a heap is a tree represented as a sequential range. The tree is constructed so that that each node is less than or equal to its parent node. See alsopush_heap, pop_heap, make_heap, is_heap, sort, stable_sort, partial_sort, partial_sort_copyCopyright © 1999 Silicon Graphics, Inc. All Rights Reserved. TrademarkInformation
