Algorithms: dynamic programming introduction

Опубликовано: 30 Декабрь 2020
на канале: Frank Stajano Explains

1,277

This video is part of Professor Frank Stajano's lecture course on Algorithms at the University of Cambridge.

Dynamic programming is a powerful technique that applies to a certain class of problems where a naïve exhaustive search approach would have exponential complexity. Through dynamic programming, these problems can be solved in low polynomial time.

Dynamic programming can be quite puzzling at first. This very brief video will give a general overview, but experience tells me that it may not completely make sense the first time you hear this. In subsequent videos I'll work through a few examples and then I'll recap. At that point this video will hopefully sound a lot clearer.

If you find my lectures useful, give the videos a thumbs up. Subscribe and hit the notification bell for more of the same and to encourage me to publish more videos for budding computer scientists. Leave your comments below.

Course web page:
https://www.cl.cam.ac.uk/teaching/cur...

Course handout:
https://www.cl.cam.ac.uk/teaching/202...

My home page:
http://frank.stajano.com