Multiple ChoiceBeginner 30s
Big-O: Definition
Big-O notation describes:
Options
- 1The exact amount of heap memory an algorithm allocates in bytes
- 2The total number of source lines executed by a program at runtime
- 3The upper bound of an algorithm growth rate as input size increases
- 4The precise wall-clock runtime of an algorithm measured in seconds
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.