Optimal Substructure

Loading...
From the course by 斯坦福大学
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
405 ratings
斯坦福大学
405 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