Back to Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University
1,275 ratings
About the Course
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
Top reviews
YA
Feb 3, 2021
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
YL
Nov 26, 2018
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
Filter by: