Suppose you think that f is a likely candidate for optimization

Run program three times:

1. With f unmemoized

2. With f memoized (to populate the cache)

3. With f memoizaed and full cache

The difference between (1) and (3) is the maximum speedup you can get by hacking on f.