Very good. Pre-memoization you are exponential. With memoization your memory usage scales like O(n**3), and your performance is O(n**4). If you passed the array by reference, and added 2 indices, you would drop a factor of n off of both.
in reply to Re: Puzzle: need a more general algorithm
in thread Puzzle: need a more general algorithm
By contrast the efficient algorithm is sub-exponential pre-memoization, and is sub-quadratic after.
Which shows that good algorithms are a big win, but being straightforward, and then applying well-known speedups to that, can still result in a usable algorithm.