Robotic Piano - Dynamic Programming Algorithm

Dynamic programming approach is comparable to divide and conquer in breaking down the matter into smaller and yet smaller attainable sub-problems.
But unlike, divide and conquer, these sub-problems aren't solved independently.
Rather, results of those smaller sub-problems are remembered and used for similar or overlapping sub-problems.
Dynamic programming is used where we've got issues, which may be divided into similar sub-problems, so their results may be re-used.
Mostly, these algorithms are used for optimization. Before finding the in-hand sub-problem, dynamic algorithmic program can attempt to examine the results of the previously solved sub-problems.
The solutions of sub-problems are combined so as to realize the simplest solution.

algorithm

Algorithm