Heap

Overview

Heap Algorithms are a special kind of Modifying Algorithm because they also change the order of the elements. But, modifying is more complicated and it usually takes more time than simple mutating operations.

Section Pages

push heap

push_heap, push_heap, \\, \\, \\, \\

Adds an element to a heap

pop heap

Removes an element from a heap

make heap

Converts a range into a heap

sort heap

sort_heap, sort_heap, \\, \\, \\, \\

Sorts the heap (it is no longer a heap after the call)

is heap

is_heap, is_heap, \\, \\, \\, \\

Checks if a range is a heap or not