In the two previous posts, we used open recursion to provide efficient solutions to dynamic programming problems, keeping the following aspects decoupled: The recurrence relation: the solution to our problem The memoization strategy: indexing into a vector The order in we compute the sub-solutions As a reminder, here is the open recurrence relation we based... Continue Reading →