Computer Engineering (CE)
Question 1: Algorithms
August 2013
Question
Part 1. (a) Assume the run time for some algorithm is given by the following recurrence: $ \begin{equation} T(n) = 2T(\sqrt[]{n}) + \log n \end{equation} $ Find the asymptotic run time complexity of this algorithm. Give detail of your computation.
(b) Assume functions $ $f$ $ and $ $g$ $ such that $ $f(n)$<.math> is <math>$O(g(n))$ $. Prove or disprove that $ $3^{f(n)}$ $ is $ $O(3^{g(n)})$ $.
