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:

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

By Kelvin

Nov 11, 2017

By Timi

Jan 23, 2021

By Rodolphe L

Mar 15, 2018

By Huimin M

Jan 10, 2021

By Aria B

Apr 23, 2020

By --

Apr 18, 2021

By Shubham C

Dec 31, 2020

By Jephte E

Dec 27, 2019

By Neil S

Mar 14, 2020

By Charles H

Jan 29, 2019

By Dustin Z

Jan 30, 2021

By 谷心洋

Mar 11, 2020

By Alexey Z

Mar 11, 2020

By Johnathan F

Jan 14, 2018

By Shiv K

Oct 16, 2017

By Ameen J

Feb 9, 2017

By Subodh C

Sep 23, 2017

By Quentin A

May 6, 2017

By Cole F

Mar 11, 2018

By Yosef A

Feb 4, 2021

By Qinghua Z

Nov 23, 2017

By Ricardo D

Dec 31, 2018

By Brande G

Jul 3, 2018

By Sriram V

Sep 6, 2020

By Genyu Z

Aug 21, 2019