Original Fibonacci and optimized Fibonacci functions and use the third variable to log the recursion times quantitatively

//Util.h
static unsigned long long factorialLoops;
long double Fibonacci35(int len);

//Util.cpp
unsigned long long Util::factorialLoops=0;
long double Util::Fibonacci35(int i)
{
    Util::factorialLoops++;
    if(i==0 || i==1)
    {
        return 1;
    }
    else
    {
        return Fibonacci35(i-1)+Fibonacci35(i-2);
    }
}

//In main.cpp


void recursion16(int i)
{
    Util ul;
    long double fib = 0;
    for (int x = 0; x < i; x++)
    {
        fib = ul.Fibonacci35(x);
        cout <<fixed<< "Fib of " << x << " is " << fib << endl;
    }

    cout<<"The recursion loops is "<<Util::factorialLoops<<endl;
}

int main(int args, char **argv)
{
    recursion16(atoi(argv[1]));
    return 0;
}

//Util.h
static unsigned long long factorialLoops; 
static map<int,long double> mp;
long double Fibnacci36(int len);

//Uti.cpp
unsigned long long Util::factorialLoops=0;
map<int,long double>Util::mp;
long double Util::Fibnacci36(int i)
{ 
    Util::factorialLoops++;
    if(i==0 || i==1)
    {
        Util::mp.insert(pair<int,long double>(i,1)); 
    }
    else
    {
        long double mpValue=(long double)(Util::mp.find(i-1)->second+Util::mp.find(i-2)->second);
        Util::mp.insert(pair<int,long double>(i,mpValue));
    }
    return Util::mp.find(i)->second;
}


//main.cpp
void recursion17(int x)
{
    Util ul;
    for(int i=0;i<x;i++)
    {
        cout<<fixed<<"Fib of "<<i<<" is "<<ul.Fibnacci36(i)<<endl;
    } 
    cout<<endl<<"The recursion loops is "<<Util::factorialLoops<<endl;
}

int main(int args, char **argv)
{
    recursion17(atoi(argv[1]));
    return 0;
}