Linearithmic sorting considers runtime complexity, space complexity, and stability

• runtime is $\mathcal{O}(n\ log(n))$
• space is $\mathcal{O} (1)$, in-place
• stable means it preserves the input ordering of equal keys

Heap Sort — sorting using iterations of heapify and sifting

Merge Sort — sorting using partitions (stable)

Quick Sort — sorting using pivoted partitions

Heap Sort

Merge Sort

Quick Sort