Question

C++ Fibonacci

Complete ComputeFibonacci() to return FN, where F0 is 0, F1 is 1, F2 is 1, F3 is 2, F4 is 3, and continuing: FN is FN-1 + FN-2. Hint: Base cases are N == 0 and N == 1.

#include <iostream>

using namespace std;

int ComputeFibonacci(int N) {

cout << "FIXME: Complete this function." << endl;

cout << "Currently just returns 0." << endl;

return 0;

}

int main() {

int N = 4; // F_N, starts at 0

cout << "F_" << N << " is "

<< ComputeFibonacci(N) << endl;

return 0;

}

Answer 1

Provided code is done as per your requirements.

• "Screen shot program code" for better understanding.
• "Code to copy" for run the program in your IDE.

Code Image:

Sample Output:

4 is 3

Code to Copy:

#include <iostream>

using namespace std;

int ComputeFibonacci(int N) {

    //Base cases are N == 0 and N == 1

    if(N == 0){

        return 0;

    }

    if(N == 1){

        return 1;

    }

    //Declare FN as type of integer

    int FN;

   

    //Call recursive function

    FN = ComputeFibonacci(N - 1) + ComputeFibonacci(N - 2);

   

    //return FN value

    return FN;

}

int main() {

    int N = 4; // F_N, starts at 0

   

    cout << "F_" << N << " is "<< ComputeFibonacci(N) << endl;

   

    return 0;

}