SC
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!
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
SC
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!
YA
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
NS
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.
SW
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.
JF
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
CF
More difficult than previous sections of the course, but thoroughly enjoyable. Looking forward to the final iteration of this series!
SK
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
NT
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.
AJ
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!
YL
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
FC
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!
AZ
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.