Efficiency: IB Computer Science practice
How fast algorithms grow. 3 questions in the style of the IB Computer Science exam.
Sample questions
What is the worst-case time complexity of a binary search on a sorted list of n items?
- O(log n)
- O(1)
- O(n)
- O(n^2)