CS Fundamentals: Big O Notation
Test your knowledge of Big O notation — the standard way to describe how an algorithm's performance scales as input size grows.
Questions cover identifying common complexity classes, comparing the growth rates of different algorithms, and recognizing Big O in familiar operations like binary search.
Every technical interview eventually asks about this — see how quickly you can classify an algorithm's complexity.
Start quiz →
Opens in a new tab on Cletica
Sample questions3 of 11 shown
Q1
What does Big O notation primarily describe?
Q2
Which Big O notation represents constant time complexity?
Q3
What is the time complexity of binary search?
What This Quiz Covers
- Constant, linear, and logarithmic time
- Quadratic and exponential time
- Comparing growth rates
- Big O of common algorithms
- Best, worst, and average case
- Why Big O ignores constants
Cletica
Want to create your own quiz?
Build surveys and quizzes, share with anyone, collect responses — free to start.
Try Cletica for free →