The Racket Blog: Dynamic Programming versus Memoization

Re:The Racket Blog: Dynamic Programming versus Memoization by spaghetti on Sunday August 26, 2012 @10:05AM (#4435100)

Memoization and dynamic programming come together in top down DP algorithms. These are also referred to as recursion with memoization. The recursive function often looks something like:

    f(arguments) {
        results = memoTable[arguments]

        if(results) // use results
        else
            results = // expensive recursive call to f
            memoTable[arguments] = results
    }

[ Parent | on HN ]

Re:The Racket Blog: Dynamic Programming versus Memoization by oskarkv on Sunday August 26, 2012 @11:21AM (#4435256)

As far as I have understood, this is just regular memoization. I mean, often in functional languages one just turns a regular function into a memoized version by calling memoize(function). Sometimes that works to create a function that does what your code does, and sometimes it does not. When it does not I think that's a shortcoming of the language/implementation.

[ Parent | on HN ]