Vidyalelo
Data Structure · Q129

Searching Algorithms

Programming · Data Structure · question 129

Q129

Choose the recursive formula for the Fibonacci series.(n>=1)

A.
F(n) = F(n+1) + F(n+2)
B.
F(n) = F(n) + F(n+1)
C.
F(n) = F(n-1) + F(n-2)
Answer
D.
F(n) = F(n-1) - F(n-2)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board