What's the most efficient way to extract a the storage from a
BinaryHeap and then sort it?
Is there a better way other than
binaryHeap.release.sort
than makes use of the heap property? For example
while (!binaryHeap.empty)
{
sortedStorage ~= binaryHeap.front;
binaryHeap.popFront;
}
?