Introduction to Dynamic Programming

Abstract: The primary objective of an algorithms course is for students to improve their ability to design algorithms that solve problems. For some such problems, a greedy approach is simple and natural, but for many other problems, greedy algorithms are not optimal. Fortunately, there is a more sophisticated technique known as dynamic programming, and it has been successfully applied in a wide range of settings. Furthermore, although this technique can seem confusing or daunting at first, it becomes more familiar with practice and exposure. In this teaching demonstration, we’ll learn the fundamentals of dynamic programming.

Bio: Kevin Sun is an Instructor in the Department of Computer Science at Elon University. His teaching interests include introductory programming, discrete mathematics, algorithms, and related topics. He is also interested in curriculum development and examining the social impacts of computing. He graduated from Duke University in 2022 with a PhD; his research was primarily in the field of online algorithms.