OLYMPIADS IN INFORMATICS, 2015, Vol. 9, pp. 45 - 55
© IOI, Vilnius University

ISSN 1822-7732

DOI: 10.15388/ioi.2015.05

Towards a Better Way to Teach Dynamic Programming


Comenius University, Bratislava, Slovakia
e-mail: forisek@dcs.fmph.uniba.sk


We give an overview of how various popular algorithm textbooks deal with the topic of dynamic programming, and we identify various issues with their expositions. In the second part of the paper we then give what we believe to be a better way of presenting the topic. While textbooks only contain the actual exposition, our paper also provides the rationale behind our choices. In particular, we managed to divide the topic into a sequence of simpler conceptual steps that are easier to learn.


algorithms, dynamic programming, memoization, task analysis.

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe

Copyright © International Olympiads in Informatics, Vilnius University Institute of Mathematics and Informatics, 2015