Recursive Fibbonaci Sequence using Dynamic Programming

DynamicFib.txt

#include <iostream>
#include <map>

std::map<int, int> dynoFib;
int fibRecursive(int n) {
    if (n <= 2) {
        return 1;
    } else  {
        if(!dynoFib.count(n)) {
             dynoFib[n] = fibRecursive(n - 1) + fibRecursive(n - 2);
        }
        return dynoFib[n];
    }

}
int fib(int n) {
    dynoFib = {};
    int rec = fibRecursive(n);
    return rec;
}


int main() {
    // Write C++ code here
    int a = fib(15);
    std::cout << a;
    return 0;
}