Fibonacci Series (Non-Recursive Method)

#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int a;
int f1=0,f2=1,f;
cout<<"Enter no.: ";
cin>>a;
cout<<"Fibonacci Series : ";
for(int i=0;i<a;i++)
{
if(i<=1)
f=i;
else
{
f=f1+f2;
f1=f2;
f2=f;
}
cout<<"  "<<f;

}
getch();

}


Popular posts from this blog

Shutdown Pc

Ellipse using OpenGl

String Comparisons