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,076 ratings
125 reviews

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:

51 - 75 of 122 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Fernando J

Jul 13, 2017

It was a great course, I really want to thank Tim for another great work.

By Jesse D

Sep 8, 2018

The most difficult course in the specialization so far. I learned a lot.

By Feiyu L

Apr 29, 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

By Katrina C

Apr 17, 2020

Dr. Roughgarden's explanations and examples are so great and helpful!

By Jonathan H

May 19, 2018

One of the best specializations on this site. Highly recommended!

By Oleg B

Mar 21, 2020

Great course. A lot to learn. Syllabus is compressed, but clear.

By Chhavi B

Jun 7, 2020

Well, the way instructor makes you understand, is really great.

By Sucre C

Mar 31, 2020

Greedy Algos are fuzzy, but funny to do the mind experiments!

By Christopher J V

Jan 2, 2018

Tougher material, but very interesting and well laid out.

By Yiming Z

Jul 31, 2018

Harder than the first two courses and I really enjoy it!

By BARUN K M

Jul 30, 2017

Very good course material with practical implementation.

By Nikola G

Aug 18, 2018

Difficult but enriching course! Really helpful to me :D

By Julius S

Jun 6, 2017

Good introductory coverage and challenging assignments.

By Trung T V

Sep 13, 2019

Thank you, teacher! This course is very helpful to me.

By Pritam M

Apr 20, 2020

very detailed, very helpful, very much worth the time

By Andre C

Jun 10, 2019

Good old fav algorithms taught with current problems.

By David H

Jun 13, 2017

I like MOOCs that force you to think and do the math.

By John W

Sep 11, 2017

Still enjoying it -- looking forward to course 4!

By Yuxuan ( G

May 25, 2020

What can I say! (again) Such a wonderful course

By Neeraj T

Jul 5, 2019

I really liked the dynamic programming part

By Rishabh K

Feb 8, 2018

clarity of exposition. stimulating lectures

By Marko D

Feb 20, 2020

Great approach to a dynamic programming.

By Abdel H D

Sep 22, 2018

Really great and challenging course!!!!

By Lin M K

Mar 27, 2018

Very difficult! That's what heroes do.