Abstract
An elegant solution to a fun problem is presented as a way to introduce dynamic programming. This problem, the Nine Tails, can be used as an introductory supplement to the traditional examples offered in many textbooks which cover dynamic programming.
- BrBr88 Brassard and Bratley, Algorithmics: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey, 1988, chapter 5. Google Scholar
Digital Library
- CLR90 Corman, Leiserson, and Rivest, Introduction to Algorithms, McGraw-Hill Book Company, New York, 1990, chapter 16. Google Scholar
Digital Library
- HoSa78 Horowitz and Sahni, Fundamentals of Computer Algorithms, Computer Science Press, RockviUe, Maryland, 1978, chapter 5. Google Scholar
Digital Library
- Sedge92 Sedgewick, Robert, Algorithms in C++, Addison-Wesley Publishing Company, New York, 1992, chapter 42. Google Scholar
Digital Library
- Weiss92 Weiss, Mark, Data Structure's and Algorithm Analysis, Benjamin/Cummins Publishing Company, Inc., 1992, section 10.3. Google Scholar
Digital Library
Index Terms
Dynamic programming for pennies a day
Recommendations
Dynamic programming for pennies a day
SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science educationAn elegant solution to a fun problem is presented as a way to introduce dynamic programming. This problem, the Nine Tails, can be used as an introductory supplement to the traditional examples offered in many textbooks which cover dynamic programming.






Comments