Multiple ChoiceIntermediate 30s
Stable Sorting
A sorting algorithm is 'stable' when it:
Options
- 1Always finishing its sorting work in O(n) time
- 2Preserves the relative order of equal elements
- 3Using a fixed O(1) amount of extra memory only
- 4Never swapping any two of its 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.