Fibnaaci series Implementation by recussion
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
#include <iostream> using namespace std; //print the Fibnacci Nubmer for a given number int fibrecur(int n) { if(n<3) return 1; else return fibrecur(n-1)+fibrecur(n-2); } int main(){ int num; cout<<"Enter the Number"<<endl; cin>>num; int n=fibrecur(num); cout<<"Finaaci Number is " << n <<endl; } |
1,566 total views, no views today
1,566 total views, no views today