Recursion Fibonacci Caching
1234567891011121314151617181920212223
let c = 0;
function fibonacci(){
let cache = {}
function fib(n){
c++;
if(n < 2){
return n;
}
if(n in cache){
return cache[n]
} else {
cache[n] = fib(n -1) + fib(n - 2)
return cache[n];
}
}
return fib;
}
console.log(fibonacci()(10))
console.log(c);
JavaScript
INFO