I have only say, fantastic.

Great course! It is hard!

hard but worthwhile

Stanford神课，占坑留名。3/4

Awesome Course!!!!!

Pretty challenging

Very great class!

very good course

excellent course

excellent! thx

Great course!

Great course!

Nice course

excellent!

very good

Great job

WONDERFUL

Excellent

good

mass

NICE

Good

T​he course material is very good indeed: kudos to the lecturer, awesome approach and superb execution. Docked one star on account of the following. Proficiency assessment in the tests not requiring to write code is a little skewed towards the mathematincal aspects of algorithms, which is fair enough and par for the course; however, enough of the test questions are worded (of course in English) in a language that is too terse and sometimes appear aimed at befuddling the reader (especially non-native speakers, well, readers...), rather than at providing a clear understanding of what is asked. Some of the coding assignments are challenging on their own account (fair enough: again, par for the course); yet again, when the question itself becomes veiled in obscure wording and lacks the clarity of examples I find something is left to be desired.

A beautiful course, I had already done the other two parts of this series of courses. This course focuses on the Greedy Algorithms and Dynamic Programming. I had not used these two types of algorithms before.

The difficulty of the exercises is not great but there is one programming assignment which is really hard to debug. Nevertheless there are good points in the forum.

Professor and forum members thank you for this beautiful learning experience.

This really helped me to understand how to approach problems with a greedy algorithm mindset or a dynamic programming mindset. My only complaint is that week 4 could have used a concrete example for the optimal binary search tree.