Is Heapsort an example of a stable sorting algorithm?
Show answer
No
A stable sort preserves the relative order of elements with equal keys. Heapsort is not stable because the process of building the heap and extracting the maximum involves non-adjacent swaps that disrupt relative order.