Big-O notation & complexity analysis
Computer Science · Algorithms
Loading practice question…
About this practice set
Big-O notation & complexity analysis is part of Computer Science (Algorithms). Questions are generated with new numbers each time you practise. Levels available: Easy. After you answer, an explanation is shown.
Example questions
A taste of what you will practise. Answers are revealed after you try.
Easy
What does Big-O notation describe?
- How runtime grows with input size
- The exact runtime
- Memory only
- Code length