Q:

C++ Program for Fibonacci Series using Recursive function

belongs to collection: C++ Functions Solved Programs

robaa
Save to bookmark
|
2022-11-26
|
  159 
0

Write a C++ Program for Fibonacci Series using Recursive function. Here’s simple Program to generate Fibonacci Series using Recursion in C++ Programming Language.

C++ programming, examples, C++ programming examples,
login and add your own answer to this question

All Answers

robaa
2022-11-26
need an explanation for this answer? contact us directly to get an explanation for this answer

What are Functions ?

Function is a block of statements that performs some operations. All C++ programs have at least one function – function called “main()”. This function is entry-point of your program.

 
 

A function declaration tells the compiler about a function’s name, return type, and parameters. A function definition provides the actual body of the function.

Defining a Function : :

The general form of a C++ function definition is as follows:

return_type Function_Name( list of parameters )
{
//function’s body
}
  • return_type : suggests what the function will return. It can be void, int, char, some pointer or even a class object.
  • Function_Name : is the name of the function, using the function name it is called.
  • Parameters : are variables to hold values of arguments passed while function is called. A function may or may not contain parameter list.
  • Function body : is he part where the code statements are written.

Below is the source code for C++ Program for Fibonacci Series using Recursive function which is successfully compiled and run on Windows System to produce desired output as shown below :

 

SOURCE CODE : :

/* C++ Program for Fibonacci Series using Recursive function  */

#include<iostream>
 using namespace std;

int fibonacci(int n)
{
    if((n==1)||(n==0))
    {
        return(n);
    }
    else
    {
        return(fibonacci(n-1)+fibonacci(n-2));
    }
}

int main()
{
    int n,i=0;
    cout<<"\nHow many terms for Fibonacci Series :: ";
    cin>>n;
    cout<<"\nFibonacci Series for [ "<<n<<" ] Terms as follows :: \n\n";

    while(i<n)
    {
        cout<<"  "<<fibonacci(i);
        i++;
    }
    cout<<"\n";

    return 0;
}

OUTPUT : :

/* C++ Program for Fibonacci Series using Recursive function  */

How many terms for Fibonacci Series :: 10

Fibonacci Series for [ 10 ] Terms as follows ::

  0  1  1  2  3  5  8  13  21  34

Process returned 0

Above is the source code for C++ Program for Fibonacci Series using Recursive function which is successfully compiled and run on Windows System.The Output of the program is shown above .

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

C++ Functions Solved Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
C++ program to Swap Values using call by reference... >>
<< C++ Program to convert Decimal Number to Binary us...