Proof of Optimal Substructure

From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
744 ratings
Stanford University
744 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

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.