Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University
About the Course
Top reviews
YA
Feb 4, 2021
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
SC
Dec 31, 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!
51 - 75 of 150 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
By Ricardo D
•Jan 1, 2019
Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.
By Brande G
•Jul 3, 2018
A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.
By Sriram V
•Sep 7, 2020
This specialization gets harder and harder. But the instructor is amazing and the course is designed beautifully.
By Genyu Z
•Aug 22, 2019
It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!
By soroush j
•Jan 30, 2023
This course and dynamic programming is harder than the first two conceptually but rewarding at the end.
By navin m
•Feb 28, 2021
Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.
Thank you, Professor.
By Vel T
•May 13, 2024
This course has two of the most difficult programming assignments I have ever encountered. Thank you!
By Garrett S
•Jan 16, 2019
Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.
By Yifan Z
•Feb 18, 2018
This part is much harder to understand than the previous parts, but it's salutary actually.
By Bhabaranjana p
•Mar 26, 2017
I am really satisfied by the course .....just love the lecture and slides too :) .....
By Yuanzhan W
•May 14, 2019
This course is harder than the previous two in the specialization but equally fun.
By Kevin H
•Oct 30, 2020
Great Course for really diving into data structures and algorithms. Thanks Tim!
By Omkar J
•Jul 3, 2020
Great Course, and a great Instructor, explains the granularity of and Algorithm
By Luiz C
•Apr 8, 2018
Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!
By Rickard A
•Jul 28, 2020
Good course! programming assignments were the most challenging but fun part!
By thomas l
•Jan 10, 2018
Very useful in the product env, but still need more time to understand more
By Nitish P
•Oct 2, 2017
Dynamic Programming is much more clear to me after watching these lectures.
By Fernando J
•Jul 14, 2017
It was a great course, I really want to thank Tim for another great work.
By Jesse D
•Sep 8, 2018
The most difficult course in the specialization so far. I learned a lot.
By Feiyu L
•Apr 30, 2018
Makes Greedy algorithm and Dynamic Programming so clear to understand.
By Katrina C
•Apr 18, 2020
Dr. Roughgarden's explanations and examples are so great and helpful!
By Jonathan H
•May 19, 2018
One of the best specializations on this site. Highly recommended!
By Oleg B
•Mar 22, 2020
Great course. A lot to learn. Syllabus is compressed, but clear.
By Chhavi B
•Jun 7, 2020
Well, the way instructor makes you understand, is really great.
By 陈松坤
•Apr 1, 2020
Greedy Algos are fuzzy, but funny to do the mind experiments!