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:

76 - 100 of 141 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Trung T V

Sep 13, 2019

By Jayana G

Aug 14, 2021

By Pritam M

Apr 20, 2020

By Andre C

Jun 10, 2019

By David

Jun 13, 2017

By John W

Sep 11, 2017

By Yuxuan ( G

May 25, 2020

By SAL20IT 6

Nov 8, 2022

By shivaranjani g

Jun 18, 2021

By Neeraj T

Jul 5, 2019

By Rishabh K

Feb 8, 2018

By Marko D

Feb 20, 2020

By Abdel H D

Sep 22, 2018

By Lin M K

Mar 27, 2018

By Yu G

Feb 3, 2021

By Rafael E

Jul 26, 2018

By Александр М

Jan 16, 2018

By Hrithwik S

Apr 8, 2020

By Miao Y

Jan 28, 2017

By Code A A

Aug 28, 2019

By Minsub L

Sep 10, 2019

By dynasty919

Mar 7, 2018

By Ellen Y

May 22, 2017

By Joseph Z

Dec 7, 2020

By Aakash K

Sep 7, 2020