Dynamic programming is an optimization technique that can be applied to recursive problems by storing intermediate results. Recursion is a concept, a way of solving problems where a function calls itself.