NCEA Level 3 Digital Technologies Practice Questions - NCEA Level 3 Digital Technologies (NZQA Achievement Standards) Exam

In Big-O time complexity analysis, what is the worst-case time complexity of Binary Search on a sorted array of size n?

O(1) O(log n) O(n) O(n log n)

Correct Answer:

O(log n)

Access more questions from this quiz

Continue to NCEA Level 3 Digital Technologies Practice Questions - NCEA Level 3 Digital Technologies (NZQA Achievement Standards) Exam for more practice questions and the full quiz experience.

Access More Questions