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 Ivan C•
It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.
par Madhumala J•
Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same
par dmitriy m•
It would be better to have more test cases linked to programming assengments. Hoppefully, there is a github branch with that already... but better to merge it to here
par Justin S•
High rank because the instructor really makes the material come alive. Not a 5-star since I wish there was more supporting materials to accompany the course. Thanks!
par Mayank K•
Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.
par Himanshu G•
great course but it would be better if you ask students to submit their code and give limits and various test cases like an actual programming contest.
par aditya s c•
very good teaching of algorithms.however a little help for coding those would be appreciated.(in my case i am dealing with graphs for the first time).
par wenqin s•
Overall experience is well, the probability overview was fast, require deep understanding with probability and statistics in discrete model.
par Sergei I•
Content is great. But handwriting is hard to understand clearly for non-native english speakers. I expected good quality of presentations.
par VIBIN V•
slightly fast paced and optional exercises are challenging . one should solve those as well to get in depth practice.
par Saumya S•
Teaching is absolutely perfect. (A grade). But the content in this sub-division of the specialization is very much theoretical.
par Soroush B•
Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.
par Mohammed S M A•
Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.
par Edson A S•
Tim Roughgarden is an incredible teacher.
You'll learn more using Tim's books on the subject, by the way.
par Taylor N•
Good explanations, but more theoretical and math-intensive than practical. Not the best way to prepare for interviews.
par Aldo C•
Excelente curso, lo deje un tiempo porque no me podía hacer el ejercicio 3 de programación pero fue por no leer bien.
One of the best courses without a doubt!. Although some topics course require more deep / comprehensive discussion
par Youya W•
The pace was kind of fast for learners with little base, better to have more reading to facilitate understanding.
par Laxmidhar P•
This Course was awesome and it can prove benefit to all the students for designing efficient and fast algorithms.
par Piotr L•
Slightly outdated in terms of slides full of handwriting, but knowledge is laid out perfectly fine. Thanks Tim!
par Золотов Д С•
The handwritten text was a bit of difficult to read. The rest of the course is just exactly what is needed.
par Pasha B•
Would be great to have more verbose assignments check results. But still awesome experience and challenge
par Rakibullah S•
Good but some videos on how the algorithms work and the proofs could have been much easier and clearer
par Haoran Z•
Great algorithm course, definitely helps people who find reading an algorithm book too boring to read.
par tanish s•
accent is difficult to understand for indian students. course is very helpful to grab deep knowledge.