Understanding a memoized Fibonacci function

Question

The function, taken from here:

function fib(n,memo) {
   memo = memo || {}
   if (memo[n]) {
      return memo[n]
   }
   if (n <= 1) {
      return 1
   }