S8:E7 - "Dynamic Programming is pretty dynamite " - podcast episode cover

S8:E7 - "Dynamic Programming is pretty dynamite "

Dec 04, 201922 min
--:--
--:--
Download Metacast podcast app
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more

Episode description

In this episode we talk about different paradigms and approaches to algorithmic design: the Divide and Conquer Algorithm, the Greedy Algorithm, and the Dynamic Programming Algorithm, which remembers the subproblems that it has seen and solved before so as not to repeat doing the same thing over again. Based on Vaidehi Joshi's blog post, "Less Repetition, More Dynamic Programming".
For the best experience, listen in Metacast app for iOS or Android
Open in Metacast
S8:E7 - "Dynamic Programming is pretty dynamite " | Base.cs Podcast - Listen or read transcript on Metacast