title: Solve recurrence: T(n) = T(n^(1/2)) + Θ(lg lg n)
body: <p>Started learning algorithms. I understand how to find theta-notation from a 'regular recurrence' like <code>T(n) = Tf(n) + g(n)</code>. But I am lost with this <a href="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/assignments/ps1.pdf" rel="nofollow">recurrence: problem 1-2e</a>:</p>
  
  <blockquote>
    <p>T(n) = T(&radic;n) + &Theta;(lg lg n)</p>
  </blockquote>
  
  <p>How do I choose the method to find theta? And what, uh, this recurrence is? I just do not quite understand notation-inside-a-recurrence thing.</p>