A Dynamic Programming Algorithm

Loading...
Do curso por Universidade de Stanford
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
413 ratings
Universidade de Stanford
413 ratings
Curso 3 de 4 em Specialization Algorithms
Na lição
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Conheça os instrutores

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science