GATE | GATE-CS-2004 | Question 83

The time complexity of the following C function is (assume n > 0)

int recursive (int n) {
   if (n == 1)
      return (1);
   else
      return (recursive (n - 1) + recursive (n - 1));
}

(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(2ⁿ)


Answer: (D)

Explanation:

See Question 4 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-4/

This solution is contributed by Anil Saikrishna Devarasetty

Quiz of this Question