|
|
|
|
|
|
by hyperman1
2177 days ago
|
|
|
It makes sense. f(n) depends on f(n-1) and f(n-2). So if the cache is able to produce these 2 values, you basically get the linear algorithm from the article. I assume the running f(n) also takes up a cache slot, hence 3 instead of 2. If this theory is correct, every recursive function f(n) requiring access to f(n-x) should have x+1 as maximum usefull cache size. |
|
|