Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University
About the Course
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.
101 - 125 of 150 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
By Code A A
•Aug 28, 2019
Great learning. Quite tough too!
By Minsub L
•Sep 10, 2019
very good course of algorithms
By dynasty919
•Mar 7, 2018
much harder than the past ones
By Ellen Y
•May 22, 2017
Stellar explanations as usual
By Joseph Z
•Dec 7, 2020
Really hard, but really fun.
By Aakash K (
•Sep 7, 2020
Great Course I learnt a lot.
By Haixu L
•Aug 18, 2020
Great course, learned a lot!
By Jhon I
•Nov 12, 2017
I have only say, fantastic.
By Sergio S
•Jul 13, 2019
Great course! It is hard!
By Shuxiao C
•Mar 6, 2018
hard but worthwhile
By zhangdi
•Dec 6, 2017
Stanford神课，占坑留名。3/4
By Minyue D
•Jul 4, 2017
Awesome Course!!!!!
By Trong N
•Jul 5, 2017
Pretty challenging
By Jerome Z
•Nov 27, 2018
Very great class!
By Sui X
•Jun 4, 2019
very good course
By Abhishek C
•Jul 11, 2018
excellent course
By Rui Z
•Sep 5, 2019
excellent! thx
By Ajit B
•Sep 4, 2020
Great course!
By Frederik D K
•Oct 25, 2019
Great course!
By Saurav M
•Mar 22, 2019
Nice course
By Zhiping L
•Jun 22, 2020
excellent!
By 陳宇恆
•Aug 7, 2020
very good
By Madhurya m
•Sep 16, 2019
Great job
By Jianghua F
•Jan 10, 2018
WONDERFUL
By francisco i
•Mar 30, 2017
Excellent