Compare how bubble, insertion, merge, and quick sort move values into place. — 7 entries
Repeatedly compare and swap neighbors so large values drift to the end.
Find the minimum of the remaining range and put it in front.
Insert each new value into the sorted prefix on its left.
Split an array in halves, then merge sorted pieces in order.
Partition around a pivot and recursively sort both sides.
Build a max heap, then move its maximum to the end repeatedly.
Count occurrences of each value, then emit values in order.
