1.

If for an algorithm time complexity is given by O(n2) then complexity will ___________

A. constant
B. quadratic
C. exponential
D. none of the mentioned
Answer» C. exponential


Discussion

No Comment Found

Related MCQs