Question

Fibonacci num Fn are defined as follow. F0 is 1, F1 is 1, and Fi+2 = Fi + Fi+1, where i = 0, 1, 2, . . . . In other words, each number is the sum of the previous two numbers.

Write a recursive function definition in C++ that has one parameter n of type int and that returns the n-th Fibonacci number. You can call this function inside the main function to print the Fibonacci numbers.

Sample Input and Output:

Display Fibonacci numbers 0-N.
Enter a limit: 5
11235
Y/y to continue, anything else quits: y Display Fibonacci numbers 0-N.

Enter a limit: 15
1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 Y/y to continue, anything else quits: n

Answer 1

#include<iostream>
using namespace std;

int fiboSeries(int N)
{
if((N==1)||(N==0))
{
return N;
}
else
{
return (fiboSeries(N-1)+fiboSeries(N-2));
}
}

int main()
{
int N ;
int i;
char ch;

while(1)
{

i=1;
cout<<"\n\nDisplay Fibonacci numbers 0-N. \n\n";
cout<<"Enter a limit : ";
cin>>N;

cout<<endl<<endl;
while(i<=N)
{
cout<<fiboSeries(i)<<" ";
i++;
}

cout<<"\n\n y to continue, anything else to quits : ";
cin>>ch;

if(ch!='y')
{
break;
}

}
cout<<endl<<endl;
system("pause");
return 0;
}