C++ program to implement Fibanocci series by recursion (Example for function recursion)

#include<iostream.h>
#include<conio.h>
int fib(int);
int main()
{
    int n;
    int f=0,s=1;
    cout<<"Enter the range";
    cin>>n;
    cout<<"fibanocci series... ";
    cout<<f<<"\t"<<s;
    for (int i=2;i<n;i++)
    cout<<"\t"<<fib(i);
    getch();
}

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