The Fibonacci series for any length n n 0 is defined as fol

The Fibonacci series for any length n (n > 0) is defined as follows: F(n) = 1, n 2 F(n-1) + F(n-2), otherwise For example, for n = 10, the series is 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. Write the C++ code for a function that takes integer n as a function parameter and prints out the Fibonacci series on the screen. Assume that the function prints a space between each value in the series. Also, it starts by printing a header statement: “ Fibonacci series for n = ”.

Solution

#include<iostream>
#include<vector>
using namespace std;

void printFibonacci(int n)
{
if(n<=0)
cout << \"Invalid value of n.\ \";
else
{
int x = 1;
int y = 1;
int z;
int i;
cout << \"Fibonacci series for n = \" << n << \" is : \";
for(i=1;i<=n;i++)
{
if(i==1 || i==2)
cout << 1 << \" \";
else
{
z = x+y;
x = y;
y = z;
cout << z << \" \";
}
}
}
cout << endl;
}

int main()
{
printFibonacci(5);
printFibonacci(10);
return 0;
}

OUTPUT:

Fibonacci series for n = 5 is : 1 1 2 3 5
Fibonacci series for n = 10 is : 1 1 2 3 5 8 13 21 34 55