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)

Explanation:

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 = .

See question 5 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-11/

This solution is contributed by Parul Sharma.

Quiz of this Question

My Personal Notes arrow_drop_up

Save