学生对 Stanford University 提供的 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的评价和反馈
课程概述
热门审阅
SC
Dec 30, 2020
Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!
SC
Sep 22, 2017
A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.
101 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的 125 个评论（共 150 个）
创建者 Code A A
•Aug 28, 2019
Great learning. Quite tough too!
创建者 Minsub L
•Sep 10, 2019
very good course of algorithms
创建者 dynasty919
•Mar 7, 2018
much harder than the past ones
创建者 Ellen Y
•May 21, 2017
Stellar explanations as usual
创建者 Joseph Z
•Dec 7, 2020
Really hard, but really fun.
创建者 Aakash K (
•Sep 7, 2020
Great Course I learnt a lot.
创建者 Haixu L
•Aug 18, 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 6, 2018
hard but worthwhile
创建者 zhangdi
•Dec 6, 2017
Stanford神课，占坑留名。3/4
创建者 Minyue D
•Jul 4, 2017
Awesome Course!!!!!
创建者 Trong N
•Jul 5, 2017
Pretty challenging
创建者 Jerome Z
•Nov 27, 2018
Very great class!
创建者 Sui X
•Jun 4, 2019
very good course
创建者 Abhishek C
•Jul 11, 2018
excellent course
创建者 Rui Z
•Sep 5, 2019
excellent! thx
创建者 Ajit B
•Sep 4, 2020
Great course!
创建者 Frederik D K
•Oct 25, 2019
Great course!
创建者 Saurav M
•Mar 22, 2019
Nice course
创建者 Zhiping L
•Jun 22, 2020
excellent!
创建者 陳宇恆
•Aug 6, 2020
very good
创建者 Madhurya m
•Sep 15, 2019
Great job
创建者 Jianghua F
•Jan 10, 2018
WONDERFUL
创建者 francisco i
•Mar 30, 2017
Excellent