Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
par Janis S
•excellent content. Learned a lot! Proofs can be a bit dull at times. But that probably simply lies in their nature.
par Aakash K
•This was an amazing course and it allowed me to learn complex algorithms and introduced me to algorithmic thinking
par Alan R M
•It really helped me understand the concept of algorithms. I confess that I have a new perspective of an algorithm.
par Raghusrinivasan J
•Great course to learn about different algorithm design paradigms and dig into the world of randomized algorithms.
par Garret N
•Very intellectually stimulating. The problems were thought-provoking and assessed understanding very effectively.
par Garrett M
•Great teacher. Coming from a science background myself, I like that the math is not watered down in the analysis.
par Balaji R
•What an amazing and insightful course. the min algorithm totally blew my mind randomized algo are simply elegant
par Alberto C
•Wonderful explanations. The companion book helps a lot to review material and have it always fresh in your mind.
par Shinjan T
•Awesome course. Learnt a lot about the theory behind a randomized algorithm. Karger's min cut was a revelation.
par Shawn W M
•He can tend to go off topic and waste time in an effort to be exactly exact, but other than that, great course.
par L H
•Fascinating course! This may be an unpopular opinion, but I loved the mathematical analysis of the algorithms.
par Keerthana S
•The material is explained really well and the programming assignments are challenging but ultimately solvable.
par Jorge B
•Excellent, great explanations and good pace. Exercises quite challenging for a newbie but you'll learn a ton.
par Jiacheng J
•Slides are concise. By going through all the slides, I'm already able to grab most of the information needed.
par Pedro G
•Some of the homeworks were difficult, but implementing the algorithms is the best way to really learn them.
par yiyefang
•A little hard to understand, but if you have done your preparation readings, it would be extremely helpful!
par Constantin M
•Great Course! Everyone should take this cousere in order to become a skilled programmer.
Not for begginers.
par Aliaksei P
•Amazing course. Tim is a very charismatic lecturer and it is always a pleasure to get back to his lectures.
par Subhashis M
•Tim Roughgarden teaches with wit and depth. Speaking with idiomatic verve, he injects life into Algorithms!
par Andrey M
•Thank you Tom. This is a great course. I got a real vision of the algorithms and started to understand it.
par Joseph R
•Can you do better in those technical interviews?
Yes! if you take this course.
I recommend buying the book.
par Jhan C
•Tim Roughgarden is an exceptional teacher. Didn't think I'd learn so much in such a short space of time!
par Abhilasha
•This Course is indeed a good source for thorough understanding of the basic concepts of the algorithms.
par Tushar
•Very nice and structured course , with an intention to imbibe the "thinkness" in students for algorithms
par Vlad K
•Material is great and well structured, assignments are challenging enough. Thanks a lot for the course!