August 2026
Intermediate
138 pages
2h 57m
English

Route optimization and speech recognition depend on existing route fragments and word sequences, respectively, and piecing them together can form a solution to a given problem. These are examples of dynamic programming, which solves problems by using solutions to subproblems. This chapter explains how to recognize such problems and specifies dynamic programming as well as the algorithm outline that implements it. As examples, it considers how to find the most profitable cuts in a rod as well as the most valuable subsequences common to a given pair. Both of these examples are solved with dynamic programming.
We ...
Read now
Unlock full access