Question

Write a recursive function that finds the n-th integer of the Fibonacci sequence(in C++ using a function). Then build a minimal program to test it. For reference see Fibonacci number. To check for recursion, please have the Fibonacci function print out its input as shown in the examples below:

INPUT:

5

OUTPUT:

fib(5)  fib(4)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  fib(2)  fib(1)  fib(0)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  
5

INPUT:

7

OUTPUT:

fib(7)  fib(6)  fib(5)  fib(4)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  fib(2)  fib(1)  fib(0)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  fib(4)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  fib(2)  fib(1)  fib(0)  fib(5)  fib(4)  fib(3)  fib(2fib(1)     fib(0)  fib(1)  fib(2)  fib(1)  fib(0)  fib(3)  fib(2)  fib(1)  fib(0)  fib(1)  
13

Answer 1

CODE IN C++:

#include <iostream>

using namespace std;
int fib(int n ){
cout << "fib(" << n << ") " ;
if(n==1 || n==2){
  
return 1 ;
}
else{
return fib(n-1) + fib(n-2);
}
}

int main()
{
int n ;
cout << "Enter an integer : " ;
cin >> n ;
int result = fib(n);
cout << "" << endl ;
cout << result << endl ;

return 0;
}

OUTPUT: