GATE | GATE-CS-2002 | Question 36

The running time of the following algorithm Procedure A(n)

  If n < = 2 return (1) 
  else return (A(Image not present√nImage not present));

is best described by :
(A) O(n)
(B) O(log n)
(C) O(log Log n)
(D) O(l1)

Answer: (C)


Now let the function is called k times


Taking log on both side (base 2).


Taking log again.


Running time complexity = number of function calls = k = Therefore Running time complexity = parul_9.

See question 5 of


This solution is contributed by Parul Sharma.


Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.