racket recursion video 6/6 ---- recursion with automatic memoization
Channel: Danny Heap
Date: 2012-06-06

Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on the most natural way to write many functions --- recursion.  Sometimes there is a performance cost if the recursive applications of a function are computed redundantly, so memoization is used to record each value of a function application the first time it's called.  And, since we don't want to write memoization code redundantly, this video shows how we can write a function to memoize another function that's already been written.  See also:

www.cdf.toronto.edu/~heap/Racket/recursion.html    See also
www.cdf.toronto.edu/~heap/racket_lectures