28 Algorithms library [algorithms]

28.7 Sorting and related operations [alg.sorting]

28.7.7 Heap operations [alg.heap.operations]

28.7.7.3 make_­heap [make.heap]

template<class RandomAccessIterator> void make_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare> void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);

1
#

Requires: The type of *first shall satisfy the MoveConstructible requirements and the MoveAssignable requirements.

2
#

Effects: Constructs a heap out of the range [first, last).

3
#

Complexity: At most 3(last - first) comparisons.