A short history of dynamic programming

October 7, 2010

« First of all, there is an exponential recursive function (like Fibonacci). Then comes the observation that partial values of this function that are computed multiple times during the recursion can actually be stored in a table and reused (memoization). Finally comes the observation that the table has a life of its own, and algorithms can run directly on it. » ~ Gad Landau

%d bloggers like this: