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,269 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).
and dynamic programming (knapsack, sequence alignment, optimal search trees).
Top reviews
RG
Apr 27, 2020
I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.
FC
Jun 30, 2018
Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!
Filter by: