I wish I read this chapter before I learn all the dynamic programming algorithms in my field. There is a very good discussion on when one should consider using DP and Greedy algorithm and one shouldn't.
I grok the rod-cutting problem. Though the other problems require a bit more understanding. I think I will go back to read the matrix multiplication problem if I reread this chapter.
I consider this chapter as highly important because many of the practical algorithms are either DP or greedy algorithm. So it is a good thing to think through why they were used and how they should be used.
No comments:
Post a Comment