Template:cpp/algorithm/notes heap
From cppreference.com
A heap with respect to comp (max heap) is a random access range [first, last) that has the following properties:
- Given N as last - first, for all integer i where 0 < i < N, bool(comp(first[(i - 1) / 2], first[i])) is false.
- A new element can be added using std::push_heap, in 𝓞(log N) time.
- *first can be removed using std::pop_heap, in 𝓞(log N) time.
