

MCQOPTIONS
Saved Bookmarks
1. |
Consider the following recursive implementation to find the nth fibonacci number:Which of the following lines should be inserted to complete thebelow code? |
A. | fibo(n – 1) |
B. | fibo(n – 1) + fibo(n – 2) |
C. | fibo(n) + fibo(n – 1) |
D. | fibo(n – 2) + fibo(n – 1) |
Answer» C. fibo(n) + fibo(n – 1) | |