All dynamic programming algorithms are recursive. They are essentially a (constructive) proof by induction. For clarity, perhaps one can include a "proof of co

All dynamic programming algorithms are recursive. They are essentially a (constructive) proof by induction. For clarity, perhaps one can include a "proof of correctness" of the algorithm in the comments.