C + + recursive solution to Fibonacci sequence problem __c++

Source of the topic: garlic
The Fibonacci sequence is a very interesting sequence, starting with 0 and 1, after which the Fibonacci coefficients are added by the previous two numbers. Ponachi
The definition of Fibonacci sequence by mathematical formula can be regarded as the following form:

#include "iostream"
using namespace std;
int fib (int n) {              
    if (n <= 1)
    {return
        n;
    }
    return fib (n-1) + fib (n-2);
}
int main (int argc, char const *argv[])
{
    int n;
    CIN >> N;
    cout << fib (n) << Endl;
    return 0;
}