Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

what is the complexity of this equation ?

$T(n) = 2*T(\sqrt n) + \log n$

and T(2) = 1.

share|cite|improve this question
up vote 1 down vote accepted

By an easy induction, $f(2^{2^n}) = (n+1)2^n$, suggesting that the answer would be $(\log \log n + 1) \log n$. Plugging this into the equation, this is indeed true.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.