Computer Science Level 3 Practice Questions - TASC Computer Science Level 3 (ITC315118) Exam

Access More Questions

Which of the following best describes the worst-case time complexity of a Binary Search algorithm operating on a sorted array of N elements?

O(1) O(log N) O(N) O(N log N)

Correct Answer:

O(log N)

Access more questions from this quiz

Continue to Computer Science Level 3 Practice Questions - TASC Computer Science Level 3 (ITC315118) Exam for more practice questions and the full quiz experience.

Access More Questions