int fibo(int n){

static map fiboMap;

if(fiboMap.find(n) != fiboMap.end())

return fiboMap[n];

if(n == 0 || n == 1)

return 1;

else

return fiboMap[n] = fibo(n-1) + fibo(n-2);

}

static map fMap;

BigInt fibo(BigInt n)

{

}

I found the fibonacci for an int using maps but how would i find the fibonacci using maps for a BigInt class.