1.

If for an algorithm time complexity is given by O((3 2)n) then complexity will be ___________

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


Discussion

No Comment Found

Related MCQs