Multiple ChoiceBeginner 30s
Stable Sort
A stable sorting algorithm:
Options
- 1Always guarantees O(n log n) time on every input
- 2Works correctly only on plain integer input values
- 3Preserves the relative order of equal elements
- 4Preserves input order by never swapping any two elements
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.