Big-O complexity
7 practice questionsComputer ScienceStep-by-step solutions
Try a few
1
What is the time complexity of accessing an element by index in an array?
A.O(1)
B.O(n)
C.O(log n)
D.O(n²)
2
Accessing an element by index in an array is which time complexity?
A.O(1)
B.O(n)
C.O(log n)
D.O(n²)
3
The worst-case time complexity of a linear search through n items is:
A.O(1)
B.O(log n)
C.O(n)
D.O(n log n)
Master big-o complexity — not just preview it
All 7 questions with worked solutions, an AI tutor that explains every step, and games that make the drilling stick. Free to start.
Practice this topic freeNo card needed · 10 free AI questions daily