Multiple ChoiceBeginner 30s
In-Place Sort
An in-place sorting algorithm:
Options
- 1Rearranges the input array using only constant auxiliary storage
- 2Orders elements without ever performing direct comparisons
- 3Uses O(1) extra space (constant memory beyond the input)
- 4Runs exclusively on the original machine hardware it was built for
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.