Vidyalelo
Data Structure · Q390

Miscellaneous on Data Structures

Programming · Data Structure · question 390

Q390

Consider the following iterative implementation to find the nth fibonacci number? int main() int n = 10,i; if(n == 1) printf("0"); else if(n == 2) printf("1"); else int a = 0, b = 1, c; for(i = 3; i <= n; i++) c = a + b; ________; ________; printf("%d",c); return 0; Which of the following lines should be added to complete the above code?

Options are not available for this question.

Answer: Option B

Solution

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