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:

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

By navin m

Feb 27, 2021

By Garrett S

Jan 15, 2019

By Yifan Z

Feb 18, 2018

By Bhabaranjan p

Mar 25, 2017

By Yuanzhan W

May 13, 2019

By Kevin H

Oct 29, 2020

By Omkar J

Jul 3, 2020

By Luiz C

Apr 8, 2018

By Rickard A

Jul 27, 2020

By thomas l

Jan 10, 2018

By Nitish P

Oct 2, 2017

By Fernando J

Jul 13, 2017

By Jesse D

Sep 8, 2018

By Feiyu L

Apr 29, 2018

By Katrina C

Apr 17, 2020

By Jonathan H

May 19, 2018

By Oleg B

Mar 21, 2020

By Chhavi B

Jun 7, 2020

By 陈松坤

Mar 31, 2020

By Masashi K

Oct 17, 2020

By Christopher J V

Jan 2, 2018

By Yiming Z

Jul 31, 2018

By Barunkumar M

Jul 30, 2017

By Nikola G

Aug 18, 2018

By Julius S

Jun 6, 2017