スタンフォード大学（Stanford University） による Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming の受講者のレビューおよびフィードバック
コースについて
人気のレビュー
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!
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.
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming： 101 - 125 / 137 レビュー
by Sergio S
•Great course! It is hard!
by Shuxiao C
•hard but worthwhile
by zhangdi
•Stanford神课，占坑留名。3/4
by Minyue D
•Awesome Course!!!!!
by Trong N
•Pretty challenging
by Jerome Z
•Very great class!
by Sui X
•very good course
by Abhishek C
•excellent course
by Rui Z
•excellent! thx
by Ajit B
•Great course!
by Frederik D K
•Great course!
by Saurav M
•Nice course
by Zhiping L
•excellent!
by 陳宇恆
•very good
by Madhurya m
•Great job
by Jianghua F
•WONDERFUL
by francisco i
•Excellent
by Thành N K
•good
by praveenkumar c
•mass
by Anirudh J
•NICE
by Sanket S
•Good
by Georgios K
•A beautiful course, I had already done the other two parts of this series of courses. This course focuses on the Greedy Algorithms and Dynamic Programming. I had not used these two types of algorithms before.
The difficulty of the exercises is not great but there is one programming assignment which is really hard to debug. Nevertheless there are good points in the forum.
Professor and forum members thank you for this beautiful learning experience.
by Brendan E
•This really helped me to understand how to approach problems with a greedy algorithm mindset or a dynamic programming mindset. My only complaint is that week 4 could have used a concrete example for the optimal binary search tree.
by Yifeng L
•Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
by Chris S
•While i thought the algorithms are very good - It could use just a small amount of expansion on the specifics and background.
Coursera Footer
