by Dinesh Thakur Category: Functions

 

#include<iostream.h>

#include<conio.h>
int func_fib(int u);
   void main()
{
      int p,n;
     clrscr();
     cout<<"\nSpecify the Number of Terms :";
     cin>>n;
     for(p=1 ;p<=n;p++)
     cout<<func_fib(p) << " ";
     getch();
}
     int func_fib(int u)
     {
             if(u==1 || u==2)
               return(1);
            else
               return(func_fib(u-1 )+func_fib(u-2));
     }

Display Fibonacci Using Recursion



About Dinesh Thakur

Dinesh ThakurDinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.



Related Articles