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:

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

By Brande G

Jul 3, 2018

A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.

By Sriram V

Sep 6, 2020

This specialization gets harder and harder. But the instructor is amazing and the course is designed beautifully.

By Genyu Z

Aug 21, 2019

It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!

By soroush j

Jan 29, 2023

This course and dynamic programming is harder than the first two conceptually but rewarding at the end.

By navin m

Feb 27, 2021

Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.

Thank you, Professor.

By Garrett S

Jan 15, 2019

Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.

By Yifan Z

Feb 18, 2018

This part is much harder to understand than the previous parts, but it's salutary actually.

By Bhabaranjana p

Mar 25, 2017

I am really satisfied by the course .....just love the lecture and slides too :) .....

By Yuanzhan W

May 13, 2019

This course is harder than the previous two in the specialization but equally fun.

By Kevin H

Oct 29, 2020

Great Course for really diving into data structures and algorithms. Thanks Tim!

By Omkar J

Jul 3, 2020

Great Course, and a great Instructor, explains the granularity of and Algorithm

By Luiz C

Apr 8, 2018

Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!

By Rickard A

Jul 27, 2020

Good course! programming assignments were the most challenging but fun part!

By thomas l

Jan 10, 2018

Very useful in the product env, but still need more time to understand more

By Nitish P

Oct 2, 2017

Dynamic Programming is much more clear to me after watching these lectures.

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 陈松坤

Mar 31, 2020

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

By Masashi K

Oct 17, 2020

The hurdles were high, but the content was very rewarding.

By Chris V

Jan 2, 2018

Tougher material, but very interesting and well laid out.