| Line 20: | Line 20: | ||
---- | ---- | ||
---- | ---- | ||
| + | ==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} | ||
Revision as of 17:21, 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}
