C++ Fibonacci Complete ComputeFibonacci() to return FN, where F0 is 0, F1 is 1,
ID: 674161 • Letter: C
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;
}
Explanation / Answer
#include <iostream>
using namespace std;
int ComputeFibonacci(int N) {
int n0=0,n1=1,temp;
if(N==0){
return 0;
}else if(N==1){
return 1;
}else{
for(int i=2;i<=N;i++){
temp=n0;
n0=n1;
n1=temp+n1;
}
return n1;
}
}
int main() {
int N = 4; // F_N, starts at 0
cout << "F_" << N << " is "
<< ComputeFibonacci(N) << endl;
return 0;
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.