Write a recursive function called Fibonacci(n) that returns nth number in Fibona

ID: 656460 • Letter: W

Question

Write a recursive function called Fibonacci(n) that returns nth number in Fibonacci series. In fibonnaci series each number after the first number is the summation of last two numbers. For example following sequence is Fibonacci series:

1,1,2,3,5,8,13,21,34... That means Fibonacci(6) should be 8 because the 6th Fibonacci number is 8 in that series

[hint: You must have a termination condition and also, express the Fibonacci number in recursive equation form based on the above definition]

simple c++ & can you make it short for me to remember for exams!

Explanation / Answer

#include<iostream>
using namespace std;
//Recursive Function starts here.
int Fibonacci(int n){
   if(n==1 || n==2)
   return 1;
   return Fibonacci(n-1)+Fibonacci(n-2);
}
//Recursive Function ends here.
int main(){
   cout <<"6th Fibonacci number is " << Fibonacci(6) << endl;
   return 0;
}

Navigate

Write a recursive function (in Java) that will test to see if the input String p

Write a recursive function called inverse_pair with a single parameter L, which

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Write a recursive function called Fibonacci(n) that returns nth number in Fibona

Question

Explanation / Answer

Related Questions

Navigate