fibonacci series.txt

1
#include <iostream> using namespace std; int Itefibonacci(int); int Recfibonacci(int); int main ( ) { int x; cout<<"please enter index x = "; cin>>x; cout<<endl<<"Result from Recursive Function "<<endl; // Here is the function call to recursive function for(int i=1; i<=x; i++ ) cout<<"fib (" << i << ") = " <<Recfibonacci(i)<<endl; cout<<endl; cout<<endl<<"Result from Iterative Function "<<endl; // Here is the function call to iterative function Itefibonacci(x); cout<<endl; return 0; } int Itefibonacci(int x) { int fib[] = {0,1,1}; for(int i=2; i<=x; i++) { fib[i%3]=fib[(i-1)%3]+fib[(i-2)%3]; cout<<"fib ( " << i << " ) = " << fib[i%3]<<endl; } return fib[x%3]; } int Recfibonacci(int x) { if(x<=0) return 0; else if(x==1) return 1; else return Recfibonacci(x-1)+Recfibonacci(x-2); }

Upload: muhammad-ali

Post on 11-Jul-2016

212 views

Category:

Documents


0 download

TRANSCRIPT

#include <iostream>using namespace std;

int Itefibonacci(int);

int Recfibonacci(int);

int main ( ){

int x;cout<<"please enter index x = ";cin>>x;cout<<endl<<"Result from Recursive Function "<<endl;

// Here is the function call to recursive function

for(int i=1; i<=x; i++ )cout<<"fib (" << i << ") = " <<Recfibonacci(i)<<endl;cout<<endl;

cout<<endl<<"Result from Iterative Function "<<endl;// Here is the function call to iterative function

Itefibonacci(x);cout<<endl;

return 0;}

int Itefibonacci(int x){

int fib[] = {0,1,1};

for(int i=2; i<=x; i++){

fib[i%3]=fib[(i-1)%3]+fib[(i-2)%3];cout<<"fib ( " << i << " ) = " << fib[i%3]<<endl;

}

return fib[x%3];

}

int Recfibonacci(int x){

if(x<=0)return 0;else if(x==1)return 1;elsereturn Recfibonacci(x-1)+Recfibonacci(x-2);

}