#heapsort

Heapsort:Sort With a Heap When You Need O(n log n) and Little Extra Memory

Build a max-heap and extract the max into the tail — guaranteed O(n log n), little extra memory, and why PriorityQueue poll-all is not this procedure.

Read More →