FTCE Computer Science Practice Questions - FTCE Computer Science K-12 (005) Exam

Access More Questions

An algorithm runs a nested loop where both the outer and inner loops iterate n times. What is its Big-O time complexity?

O(n) O(log n) O(n^2) O(2^n)

Correct Answer:

O(n^2)

Access more questions from this quiz

Continue to FTCE Computer Science Practice Questions - FTCE Computer Science K-12 (005) Exam for more practice questions and the full quiz experience.

Access More Questions