Sunday, January 27, 2013

Optimal substructure - Wikipedia, the free encyclopedia

Optimal substructure - Wikipedia, the free encyclopedia: "In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed efficiently from optimal solutions of its subproblems. This property is used to determine the usefulness of dynamic programming and greedy algorithms for a problem.[1]"

'via Blog this'