Chapter 8: Tangled Dependencies and Memoization. This chapter is about the design method (or, historically,
the problem) called, somewhat confusingly, dynamic programming. It is an advanced technique that can be hard to
master but that also yields some of the most enduring insights and elegant solutions in the field.
Chapter 9: From A to B with Edsger and Friends. Rather than the design methods of the previous three chapters, the
focus is now on a specific problem, with a host of applications: finding shortest paths in networks, or graphs. There are
many variations of the problem, with corresponding (beautiful) algorithms.
Do'stlaringiz bilan baham: |