fibonacci series c++ recursion code example

Example 1: fibonacci sequence c++

#include <iostream>
using namespace std;

int main ()
{
    int num1, num2, num3, input; 
    num1 = 0;
    num2 = 1;
    cout << "How many nums in sequence do you want to see: "; 
    cin >> input; 
    cout << num1 << " " << num2 << " "; 

    for(int i = 2; i < input; i++) // runs through every element but first two 
    {
        num3 = num1 + num2; 
        cout << num3 << " "; 
        num1 = num2; 
        num2 = num3; 
    }
    
    return 0;
}

Example 2: fibonacci series in c++ Recursive

#include<iostream>
using namespace std;
int fib(int n) {
   if (n <= 1)
   return n;
   return fib(n-1) + fib(n-2);
}
int main () {
   int n = 10, i;
   for(i=0;i<n;i++)
   cout<<fib(i)<<" ";
   return 0;
}