Multiple ChoiceBeginner 30s
O(n) — Linear Time
An O(n) algorithm:
Options
- 1Grows logarithmically as input grows
- 2Grows proportionally with input size
- 3Stays independent of the input size
- 4Grows exponentially as input grows
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.