## make_heap
## Prototype
template <class RandomAccessIterator> void make_heap(RandomAccessIterator first, RandomAccessIterator last); template <class RandomAccessIterator, class StrictWeakOrdering> void make_heap(RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp); ## Description
The two versions of ## DefinitionDefined in the standard header algorithm, and in the nonstandard backward-compatibility header algo.h. ## Requirements on typesFor the first version: -
`RandomAccessIterator` is a model of RandomAccessIterator. -
`RandomAccessIterator` is mutable. -
`RandomAccessIterator` 's value type is a model of LessThanComparable. -
The ordering on objects of
`RandomAccessIterator` 's value type is a*strict weak ordering*, as defined in the LessThanComparable requirements.
For the second version: -
`RandomAccessIterator` is a model of RandomAccessIterator. -
`RandomAccessIterator` is mutable. -
`StrictWeakOrdering` is a model of StrictWeakOrdering. -
`RandomAccessIterator` 's value type is convertible to`StrictWeakOrdering` 's argument type.
## Preconditions-
`[first, last)` is a valid range.
## ComplexityLinear. At most ## 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 RandomAccessIterator ## See also |