HAVO Informatica Practice Questions - Netherlands HAVO Informatica - Schoolexamen Only Exam

Binary search on a sorted array of n elements typically has time complexity on the order of

O(n) O(log n) O(n²) O(2ⁿ)

Correct Answer:

O(log n)

Access more questions from this quiz

Continue to HAVO Informatica Practice Questions - Netherlands HAVO Informatica - Schoolexamen only Exam for more practice questions and the full quiz experience.

Access More Questions