wayanjimmy/js-algorithms

View on GitHub
src/memoized-fibonacci.js

Summary

Maintainability
A
35 mins
Test Coverage
function fibMemo(index, cache = []) {
  if (cache[index]) {
    return cache[index]
  } else {
    if (index < 3) {
      return 1
    } else {
      cache[index] = fibMemo(index - 1, cache) + fibMemo(index - 2, cache)
    }
  }

  return cache[index]
}

module.exports = fibMemo