Lower Saxony Zentralabitur Informatics Practice Questions - Lower Saxony Zentralabitur Informatics (Informatik) Exam

What is the time complexity of binary search on a sorted list of n elements?

O(log n) O(n²) O(n!) O(2^n)

Correct Answer:

O(log n)

Access more questions from this quiz

Continue to Lower Saxony Zentralabitur Informatics Practice Questions - Lower Saxony Zentralabitur Informatics (Informatik) Exam for more practice questions and the full quiz experience.

Access More Questions