Ononot — The recurrence T(n) = 2T(\sqrt{n}) + \log2 n arises in analy

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

The recurrence $T(n) = 2T(\sqrt{n}) + \log_2 n$ arises in analyzing a recursive algorithm. Using the substitution $m = \log_2 n$ , the recurrence becomes $S(m) = 2S(m/2) + m$ . What is $\Theta(S(m))$ , and therefore $\Theta(T(n))$ in terms of $n$ ?