The Dynamic Planning algorithm can be used in both Top-down and Bottom-up methods. And of course, if based on the CPU's working life cycle, the reference to the results of the previous solution is less expensive than solving the problem.
According to Tutorialspoint
Previous article: Algorithm for sharing (divide and conquer)
Next lesson: Theorem mechanic's algorithm (Master Theorem)