스탠퍼드 대학교의 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 학습자 리뷰 및 피드백
강좌 소개
최상위 리뷰
SW
Feb 25, 2019
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
NT
Jun 14, 2019
As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming의 96개 리뷰 중 51~75
교육 기관: Rishabh K
•Feb 08, 2018
clarity of exposition. stimulating lectures
교육 기관: Marko D
•Feb 20, 2020
Great approach to a dynamic programming.
교육 기관: Abdel H D
•Sep 22, 2018
Really great and challenging course!!!!
교육 기관: Lin M K
•Mar 27, 2018
Very difficult! That's what heroes do.
교육 기관: Rafael E
•Jul 26, 2018
Another great course from Coursera!
교육 기관: Александр М
•Jan 16, 2018
Great course! Challenging and fun.
교육 기관: YangMiao
•Jan 29, 2017
It's challenging but interesting.
교육 기관: amosnier
•Aug 28, 2019
Great learning. Quite tough too!
교육 기관: Minsub L
•Sep 10, 2019
very good course of algorithms
교육 기관: dynasty919
•Mar 07, 2018
much harder than the past ones
교육 기관: Ellen Y
•May 22, 2017
Stellar explanations as usual
교육 기관: Jhon I
•Nov 12, 2017
I have only say, fantastic.
교육 기관: Sergio S
•Jul 13, 2019
Great course! It is hard!
교육 기관: Shuxiao C
•Mar 06, 2018
hard but worthwhile
교육 기관: zhangdi
•Dec 06, 2017
Stanford神课，占坑留名。3/4
교육 기관: Minyue D
•Jul 04, 2017
Awesome Course!!!!!
교육 기관: Nguyen T
•Jul 05, 2017
Pretty challenging
교육 기관: Frank Z
•Nov 27, 2018
Very great class!
교육 기관: Sui X
•Jun 04, 2019
very good course
교육 기관: Abhishek C
•Jul 11, 2018
excellent course
교육 기관: Rui Z
•Sep 05, 2019
excellent! thx
교육 기관: Frederik D K
•Oct 25, 2019
Great course!
교육 기관: Saurav M
•Mar 22, 2019
Nice course
교육 기관: Madhurya R
•Sep 16, 2019
Great job
교육 기관: Jianghua F
•Jan 10, 2018
WONDERFUL