Fibonacci Series (Recursive Method)

#include<iostream>
#include<conio.h>
using namespace std;
int fibonacci(int x)
{
if(x==0)
return 0;
else if(x==1)
return 1;
else
return (fibonacci(x-1)+fibonacci(x-2));
}
int main()
{
int a,i=0;
cout<<"Enter no.: ";
cin>>a;
cout<<"Fibonacci Series: ";
for(int c=1;c<=a;c++)
{
cout<<" "<<fibonacci(i);
i++;
}
getch();
return 0;
}
Output:

Popular posts from this blog

Shutdown Pc

Ellipse using OpenGl

String Comparisons