Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2004 | Question 83
  • Last Updated : 26 Sep, 2014

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(n2)
(D) O(2n)


Answer: (D)

Explanation:

anil_ds_83
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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :