Example [Review - Optional]

From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
376 ratings
Stanford University
376 ratings
Course 3 of 4 in the Specialization Algorithms
From the lesson
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Computer Science