title: Solving T(n) = 2T(n^(1/2)) + 1 asymptotically using a recursion tree?
body: <p>I need to solve the recurrence</p>
  
  <blockquote>
    <p>T(n) = 2T(n<sup>1/2</sup>) + 1</p>
  </blockquote>
  
  <p>I need to find the asymptotic time complexity. I'm using the recursion tree method but I'm getting stuck. I know the answer is &Theta;(log n), but I'm not sure how to arrive at this. How do you solve this recurrence?</p>