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,246 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

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.

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!

Filter by:

76 - 100 of 145 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Yiming Z

Jul 31, 2018

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

By Barunkumar 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

Jun 13, 2017

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

By Marko N

Mar 9, 2024

Great resource for Dynamic Programming algorithms

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 SAL20IT 6

Nov 8, 2022

course was very interesting and informating.

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.

By Yu G

Feb 3, 2021

Tough and highly-recommended course.

By Rafael E

Jul 26, 2018

Another great course from Coursera!

By Александр М

Jan 16, 2018

Great course! Challenging and fun.

By Hrithwik S

Apr 8, 2020

Elaborate theory in many aspects.

By YangMiao

Jan 28, 2017

It's challenging but interesting.

By Code A A

Aug 28, 2019

Great learning. Quite tough too!

By Minsub L

Sep 10, 2019

very good course of algorithms

By dynasty919

Mar 7, 2018

much harder than the past ones