1.

Consider the following recursive implementation to find the nth fibonnaci number: Which of the following is the base case?

A. if(n == 1)
B. else if(n == 2)
C. return fibo(n – 1) + fibo(n – 2)
D. both if(n == 1) and else if(n == 2)View Answer
Answer» E.


Discussion

No Comment Found

Related MCQs