GATE 2009 CS – Question 35
For a constant c, $T(n)=n$ for $n\le3$, and $T(n)=T(n/3)+cn$ otherwise. What is the time complexity?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (A) $\Theta(n)$
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Asymptotic Analysis and Time/Space Complexity questions
- GATE 2008 CS Q39
- GATE 2007 CS Q15
- GATE 2007 CS Q44
- GATE 2007 CS Q45
- GATE 2007 CS Q51
- GATE 2026 CS (CS1) Q17
All Asymptotic Analysis and Time/Space Complexity questions →