02-16-2017, 01:42 PM
A DP is an algorithmic method which is generally based on a repeated formula and one starting states. A sub-solution of the issue is designed from previously found ones. DP solutions have a polynomial difficulty which assures a much faster going time than other techniques like backtracking, brute-force etc.