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 mentionedI have been asked this question in exam.My question is from Algorithms topic in portion Algorithms of Discrete Mathematics

Answer»

The CORRECT option is (c) EXPONENTIAL

Easiest explanation: The GROWTH RATE of that function will be exponential therefore COMPLEXITY will be exponential.



Discussion

No Comment Found

Related InterviewSolutions