title: What is Time Complexity of the following function?
body: <pre><code>int DoSomething(int n) {
      if(n &lt; 2) return 1;
      else return DoSomething(floor(sqrt(n))) + n;
  }
  </code></pre>
  
  <p>According to me the corresponding recurrence will be :</p>
  
  <p><img src="https://i.stack.imgur.com/AiEnh.jpg" alt="Recurence Relatio"></p>
  
  <p>Solving this recurence...</p>
  
  <p>Putting <img src="https://i.stack.imgur.com/kOYeK.jpg" alt="Substitute 1"></p>
  
  <p>The function becomes </p>
  
  <p><img src="https://i.stack.imgur.com/o5Cu1.jpg" alt="Rest of the image"></p>
  
  <p>Can you please verify &amp; rectify the solution?</p>