Heapsort
Build a max heap, exchange its root with the last active element, shrink the active heap and restore heap order; repeat.
Key knowledge
Build a max heap, exchange its root with the last active element, shrink the active heap and restore heap order; repeat. The resulting array is sorted in O(n log n) worst-case time with O(1) auxiliary array storage.
Conditions and scope
- Use an iterative in-place heap implementation and bounded-cost comparisons.
- Ordinary heapsort is not stable for equal-key records.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 8 priority-queue sort and in-place heap-sort construction.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-heapsort
- Revision
- university-core.1
- Structured reference record
- University core expansion