GATEverse
← GATE CSE 2004

Q83

MCQ2 marks, −0.5

The time complexity of the following C function is (assume n>0n > 0) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }

Sign in to save attempts.

Loading…