Heapsort

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Average performance

O ( n log ⁡ n ) {\displaystyle O(n\log n)}

Best-case performance

O ( n log ⁡ n ) {\displaystyle O(n\log n)} (distinct keys) or O ( n ) {\displaystyle O(n)} (equal keys)

Class

Sorting algorithm

Data structure

Array

Worst-case performance

O ( n log ⁡ n ) {\displaystyle O(n\log n)}

Worst-case space complexity

O ( n ) {\displaystyle O(n)} total O ( 1 ) {\displaystyle O(1)} auxiliary