The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+14 votes
4.9k views

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));
}
  1. $O(n)$
  2. $O(n \log n)$
  3. $O(n^2)$
  4. $O(2^n)$
in Algorithms by Veteran (52.1k points)
edited by | 4.9k views

4 Answers

+27 votes
Best answer

Answer is D) $O(2^n)$

 

int recursive (int n) {
    if(n == 1)      // takes constant time say 'A' time
        return (1); // takes constant time say 'A' time
    else
        // takes T(n-1) + T(n-1) time
        return (recursive (n-1) + recursive (n-1));
}

 

$T(n) = 2T(n - 1) + a$ is the recurrence equation found from the pseudo code. Note: $a$ is a constant $O(1)$ cost that the non-recursive part of the function takes.

Solving the recurrence by Back Substitution:

$$\begin{align}
T(n) &=  2T(n - 1) + a \\[1em]
T(n - 1) &= 2T(n - 2) + a \\[1em]
T(n - 2) &= 2T(n - 3) + a \\[1em]
&\vdots
\end{align}$$

Thus, we can re-write the equation for $T(n)$ as follows

 $$\begin{align*}
T(n)
&= 2 \Bigl [ 2T(n - 2) + a \Bigr ] + a &= 4T(n - 2) + 2a + a \\[1em]
&= 4 \Bigl [ 2T(n - 3) + a \Bigr ] + 3a &= 8T(n - 3) + 4a + 2a + a \\[1em]
&\vdots \\[1em]
&= 2^k T(n - k) + (2^k - 1) a
\end{align*}$$

On Substituting Limiting Condition

$$
T(1) = 1 \\
\implies n - k = 1 \\
\implies k = n - 1
$$

Therefore, our solution becomes

$$2^{n - 1} + \Bigl ( 2^{n - 1} - 1 \Bigr ) a \\ = O(2^n)$$

by Boss (21.2k points)
edited by
+2
You explain well - all points included :)

HTML spacing for alignment is bad- even if we align spaces properly when the screen resolution changes it becomes bad. Latex is better :)
+1
Thank you sir :) . I will try to improve next time.
0
It will be (2^k)-1
+16 votes
Its similar to tower of hanoi problem

$$T(n)=2T(n-1) + 1$$
T(1)=1

T(2)=2.1 + 1 =3

T(3)=2.3 +1 =7

T(4)=2.7 +1 =15 .... .....

T(n)=2.T(n-1)+ 1

we can see that its a pattern getting formed which is $t(n)=2^n-1$ so it is d $O(2^n)$
by Boss (14.3k points)
0
@Bhagirathi: why this 1 after 2T(n-1)
+1

@Gate Mm:

T(n) = 2T(n-1)+1. Here +1 is for the base condition if(n==1) return 1. It has the constant time complexity of 1.
 

+1
No it's not for that. 1 in the recursive equation signifies that some work has been done to divide a problem into two subproblems.

Base condition if(n==1) return 1 is used at the end.
0
@amitatgateoverflow is correct.

1 or some constant term is there to denote the amount of work to be done to divide the original problem and then combine the solutions to those subproblems to get the final answer.
+8 votes

The recurrence relation from the code is :

T(n) = 2T(n-1) + 1

The above recurrence can be solved easily with the help of Subtract and conquer master's theorem.

Here a=2, b=1 d=0

Since a>1, the third case applies

O(n0 . 2n/1) = O(2n) Option (d)

Reference : https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwiapt6kxLXTAhVCOo8KHVOMCLYQFggiMAA&url=https%3A%2F%2Fwww.eecis.udel.edu%2F~saunders%2Fnotes%2Frecurrence-relations.pdf&usg=AFQjCNEDfKzz_SaGkG9uYob8-Ut4qV7jww&sig2=MZlwUU2OTfrZF0p_6ddVbA

by Boss (25.4k points)
0
how could we know 'd ' value.
0

Read the theorem statement again and you would know.

F(n) is in O(nd)

0
Sir can we solve it by finding homogenous and particular solution?

Answer by that method :: (2^n)-1. Is that correct?
0
yes you can do it that way too , but it would be a lengthy way to solve . Single term recurrence relation is advised to be solved by substitution or tree method.
+3 votes

Another way to visualize this problem.

by Active (2.3k points)
0
F(2) = 2 ??? how ??
0
@Puja Mishra You can find that easily by putting $n = 2$ in the code. The $return$ part in the $else$ block will return $recursive(1) + recursive(1)$.
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,845 questions
54,783 answers
189,422 comments
80,416 users