Linked from

The 4 pages that link to Heapsort, each with the reason it gives.

• Sorting algorithmBroader topic: It uses a heap to achieve guaranteed efficient sorting with little extra memory.

• In-place algorithmBroader topic: Heapsort sorts an array in place with constant auxiliary storage.