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

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:

101 - 125 of 141 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Haixu L

Aug 18, 2020

By Jhon I

Nov 12, 2017

By Sergio S

Jul 13, 2019

By Shuxiao C

Mar 6, 2018

By zhangdi

Dec 6, 2017

By Minyue D

Jul 4, 2017

By Trong N

Jul 5, 2017

By Jerome Z

Nov 27, 2018

By Sui X

Jun 4, 2019

By Abhishek C

Jul 11, 2018

By Rui Z

Sep 5, 2019

By Ajit B

Sep 4, 2020

By Frederik D K

Oct 25, 2019

By Saurav M

Mar 22, 2019

By Zhiping L

Jun 22, 2020

By 陳宇恆

Aug 7, 2020

By Madhurya m

Sep 16, 2019

By Jianghua F

Jan 10, 2018

By francisco i

Mar 30, 2017

By Thành N K

Aug 25, 2019

By praveenkumar c

Jun 12, 2019

By Anirudh J

Aug 10, 2018

By Sanket S

Jul 7, 2017

By Alberto S

May 2, 2022

By Georgios K

Feb 1, 2020