Vidyalelo
Data Structure · Q95

Dynamic Programming in Data Structures

Programming · Data Structure · question 95

Q95

Consider the following code to find the nth fibonacci term: int fibo(int n) if n == 0 return 0 else prevFib = 0 curFib = 1 for i : 1 to n-1 nextFib = prevFib + curFib __________ __________ return curFib Complete the above code.

Options are not available for this question.

Answer: Option C

Solution

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