The C++ standard library comes with a std::priority_queue type (as well as standalone heap operations) that works as an adapter around a random-access container. We should add microbenchmarks for its operations so that we have an additional set of baselines against which we could compare Heap's performance.
The C++ standard library comes with a
std::priority_queuetype (as well as standalone heap operations) that works as an adapter around a random-access container. We should add microbenchmarks for its operations so that we have an additional set of baselines against which we could compareHeap's performance.