Proof of Optimal Substructure

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
246 ratings
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

246 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
    Professor
    Computer Science