That book does not describe how its recursive equations can be efficiently programmed, as it was written in 1957.
The book that introduced this technique referred to it as a "multi-stage" decision process (**). That book does not describe how its recursive equations can be efficiently programmed, as it was written in 1957. These equations, named for Richard Bellman, can be (*) efficiently solved if computation is performed in a "bottom up" manner. However, in the absence of memoization, computing these equations may be intractable if performed in a "top down" manner. As a result, divide-and-conquer methods typically yield disastrous running times for problems that require algorithms designed under this principle. Among the problems that can be solved using this technique are the Edit Distance problem and the Matrix Chain Multiplication problem. For ten points, name this algorithm design paradigm that can be used to find the longest common subsequence between two strings.
The book that introduced this technique referred to it as a "multi-stage" decision process (**).
Dynamic Programming