|August 1999||Perl Hardware Store||Slide #29|
Suppose you think that f is a likely candidate for optimization
Run program three times:
With f unmemoized
With f memoized (to populate the cache)
With f memoizaed and full cache
The difference between (1) and (3) is the maximum speedup you can get by hacking on f.
|Next||Copyright © 1998 M-J. Dominus|