dynamic programming

     

In mathematics an computer science, dynamic programming is a method of solving problems exhibiting the properties of overlapping subproblems and optimal substructure (described below) that takes much less time than naive methods.

Found pages about dynamic programming