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; } ?
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; } ?