FamousFrizzyEngineering created by hillal20 - https://repl.it/@hillal20/FamousFrizzyEngineering

dynamicPrograming.js

function naivefib(n){
  if ( n < 3 ){
    return 1
  }
  return naivefib(n-1) + naivefib(n-2)
}
console.log(naivefib(20))


/// memorized solution 

let result 
let arr = []
function fib(n){
 if (arr[n] !== null && arr[n]!== undefined){
   return arr[n]
 }
if ( n < 3 ){
  return 1
}
else{
  result = fib(n-1) + fib(n-2)
  arr[n]= result
return result
}
}
console.log(fib(1000))

//////// buttom up 

let newarr = []
function newfib(n){
  if ( n < 3 ){
  return 1
}

newarr[1] = 1;
newarr[2] = 1;
for(let i = 3; i <= n ; i ++ ){
  newarr[i] = newarr[i-1] + newarr[i-2]
}

return newarr[n]
}
console.log(newfib(1000))