| Line 23: | Line 23: | ||
'''Part 1. ''' | '''Part 1. ''' | ||
Assume the run time for some algorithm is given by the following recurrence: | Assume the run time for some algorithm is given by the following recurrence: | ||
| + | <math> | ||
\begin{equation} | \begin{equation} | ||
T(n) = 2T(\sqrt[]{n}) + \log n | T(n) = 2T(\sqrt[]{n}) + \log n | ||
\end{equation} | \end{equation} | ||
| + | </math> | ||
Revision as of 16:22, 20 July 2017
Computer Engineering (CE)
Question 1: Algorithms
August 2013
Question
Part 1. Assume the run time for some algorithm is given by the following recurrence: $ \begin{equation} T(n) = 2T(\sqrt[]{n}) + \log n \end{equation} $
