Algorithms | Analysis of Algorithms (Recurrences) | Question 8

Last Updated :
Discuss
Comments

What is the time complexity of the following recursive function: 
 

c 
int DoSomething (int n) 
{
  if (n <= 2)
    return 1;
  else  
    return (DoSomething (floor(sqrt(n))) + n);
}

(A) [Tex]\\theta   [/Tex](n) 
(B) [Tex]\\theta   [/Tex](nlogn)
(C) [Tex]\\theta   [/Tex](logn)
(D) [Tex]\\theta   [/Tex](loglogn)
 

A

B

D

C

This question is part of this quiz :

Top MCQs on Complexity Analysis using Recurrence Relations with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy