title: Solving the recurrence relation T(n) = √n T(√n) + n
body: <p>Is it possible to solve the recurrence relation</p>
  
  <blockquote>
    <p>T(n) = √n T(√n) + n</p>
  </blockquote>
  
  <p>Using the Master Theorem?  It is not of the form</p>
  
  <blockquote>
    <p>T(n) = a &sdot; T(n / b) + f(n) </p>
  </blockquote>
  
  <p>but this problem is given in the exercise of CLRS chapter 4.</p>