Memoized Recursive Fibonacci Calls (Diagrammed)
Channel: Khan Academy Computing
Date: 10/12/2019

This diagram traces the calls that the computer makes while executing a memoized recursive algorithm to calculate Fibonacci numbers for an input of 5. After calculating each number, the results are stored in the "memo" (a lookup table), which reduces the amount of recursive calls later.
Learn more on Khan Academy: https://www.khanacademy.org/computing/computer-science/algorithms/recursive-algorithms/a/improving-efficiency-of-recursive-functions