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".

Rss Apple Podcaster
Podden och tillhörande omslagsbild på den här sidan tillhör CodeNewbie. Innehållet i podden är skapat av CodeNewbie och inte av, eller tillsammans med, Poddtoppen.