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!

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.

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.

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!

A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.

More difficult than previous sections of the course, but thoroughly enjoyable. Looking forward to the final iteration of this series!

Outstanding course. Prof. Roughgarden is enthusiastic. The lectures, programming problems, and readings build a solid understanding.

Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.

While i thought the algorithms are very good - It could use just a small amount of expansion on the specifics and background.

Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.

It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!

Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;

Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.

I am really satisfied by the course .....just love the lecture and slides too :) .....