CS-2002 Question Paper With Solutions

Q. 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(1)

Answer: (C)

Explanation: