On 8/6/12, Philippe Sigaud <[email protected]> wrote: > Which reminds me... What if someone wants Fibonacci values depending > on a runtime value, but would like them to be calculated really fast?
I think TDPL had some use of the memoize template and used fibonacci as sample code. It even used it internally for a recursive call. It's somewhere in the book.
