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,193 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:

1 - 25 of 140 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Sachin W

Feb 25, 2019

By Rúben G

Apr 27, 2020

By Huong M L

Apr 29, 2020

By Fernando L C

Jun 29, 2018

By Nicolas T

Jun 14, 2019

By Prince C S

Sep 5, 2021

By Rishabh T

May 27, 2019

By Daniel P

Jan 19, 2017

By Alexander L

Nov 11, 2019

By Kaan A

Nov 7, 2019

By Janis S

Oct 27, 2020

By Dhruvesh P

Nov 18, 2017

By Alexey P

Mar 8, 2017

By Dilyan M

Dec 10, 2018

By Damian C

Mar 22, 2018

By Jonathan M

May 18, 2020

By GongPing

Aug 20, 2017

By Sergey T

Jun 28, 2020

By Long N

Feb 28, 2021

By Ali İ E

Apr 27, 2022

By Ashish S

Aug 12, 2018

By Ahmad B E

Jun 16, 2017

By Christian K

Apr 25, 2021

By Oleksandr S

Feb 17, 2020

By Anastasia Z

Jan 30, 2018