Chevron Left
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

4.8
stars
1,209 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

FC

Jun 29, 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!

RG

Apr 26, 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.

Filter by:

126 - 141 of 141 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Brendan E

Jun 17, 2017

By Yifeng L

Nov 27, 2018

By Diego F

Aug 15, 2022

By Chris S

May 29, 2018

By Pawel K S

Sep 20, 2018

By Andrey

May 15, 2017

By Navneet K C

Sep 6, 2021

By Tianyi Z

Jul 17, 2018

By PLN R

Oct 13, 2018

By Siyu Z

May 14, 2017

By Anant K S

May 22, 2019

By Yash G

Jan 21, 2018

By Bianca D

Mar 23, 2019

By Joern K

Aug 30, 2018

By Zheng W

Jul 10, 2017

By Atul V

Oct 6, 2019