스탠퍼드 대학교의 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 학습자 리뷰 및 피드백
강좌 소개
최상위 리뷰
Apr 27, 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.
Jun 30, 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!
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming의 119개 리뷰 중 76~100
교육 기관: 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
교육 기관: Aakash K
•Sep 07, 2020
Great Course I learnt a lot.
교육 기관: Haixu L
•Aug 19, 2020
Great course, learned a lot!
교육 기관: 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
교육 기관: Ajit C B
•Sep 04, 2020
Great course!
교육 기관: Frederik D K
•Oct 25, 2019
Great course!
교육 기관: Saurav M
•Mar 22, 2019
Nice course
교육 기관: Zhiping L
•Jun 23, 2020
excellent!
교육 기관: Yuheng C
•Aug 07, 2020
very good
교육 기관: Madhurya R
•Sep 16, 2019
Great job
교육 기관: Jianghua F
•Jan 10, 2018
WONDERFUL
교육 기관: francisco i
•Mar 30, 2017
Excellent
