Question

Given a program to find the nth term in the Fibonacci series using recursion. Fill
the missing code so as to pass through all the test cases.
Note that the first 2 terms in the Fibonacci Series are 0 and 1.​

Answer 1

Answer:

int find(int n){

if(n==1)return 1;

if(n==0)return 0;

return find(n-1)+find(n-2);

}

Explanation:

fib(n)=fib(n-1)+fib(n-2)