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 Muhammad S A•
Great Algorithm analysis overview. Concepts are simply explained. Although If you are absolute beginner I recommend you to read the basics term used in statistics.
par Lin M K•
Probably, the best course to start learning algorithms. It's not too easy, not too difficult. It's just challenging enough for those who want to learn algorithms.
par Yann F•
Very well designed, structured and delivered. I enjoyed the videos and learned a lot from the lectures, quizzes, forum and programming assignments. Great course.
par João R W S•
Very good. Not an easy course but I think that's the idea haha. Tim is a great teacher and the content is very well organized to be didactic. I've learned a lot!
par Kandarp K V•
It is really a very good course if you want to gain deep insight about algorithms. Definitely was slightly above my rank but that's how we learn and think more.
par Александр М•
This course can be really useful not only for junior engineers or students but also for middle engineers. It was fun and challenging. Thank you for this course.
par Ashish K•
A very good course for having the notion of algorithms, identify problems which can be solved by divide and conquer approach and analyse their time complexity.
par Yasar A A•
At first, I found difficulty in catching the content..... it would bounce upon my head rather understanding... overall it was worth of hard work. Good Content
par LIU C•
The instructor is simply super cool in teaching. He managed to explain things with all the necessary details in the most concise language. highly recommended.
par Sukhdev S•
The course was intense at times, specially the Randomized Contraction Algorithm. Conceptually, it was fine, but the implementations took some serious effort.
par Rishi G V•
It is Really an amazing Course, mind blowing, very informative, It gives me the complete understanding merge sort and quick with best mathematical analysis.
par Matt L•
Well-taught, I love Tim Roughgarden's lecture style. Though he doesn't pull punches when it comes to the math, it's very straightforward and easy to follow.
par Thomas L•
I thought this was an excellent overview of the basics of sorting and recursion algorithms and taught at a rigorous level appropriate for college students.
par John C•
I loved it. It's challenging. Definitely requires some thought outside of what he videos cover for some of the quiz questions, but still totally doable.
par Parshwanath D•
I'm not a Computer Science student and yet I found these lectures easy to follow. The programming exercises were a good mental exercise. Wonderful course!
par Abhishek V•
Very good review of divide and conquer algorithms, however, I only recommend for those who are willing to put in the hard work as I found it challenging.
par Peshotan I•
Very good course. Teaches the basics of algorithms very well. Lectures are great but I mostly studied from textbook (you can find it on amazon for $10).
par Mayur R P•
Can we do better?
Search for best optimised way using Divide and Conquer..
Thanks to Tim (instructor) for creating such a great interactive program.
Very well done and presented material! In depth and gives you a deeper understanding of the material (if you pay close attention in lectures that is)!
par Minsub L•
Very good lecture to improve algorithm skills and basics for those who had not ever take class of algorithms. Thank you for your teaching, professor.
par Rebecca D•
I thoroughly enjoyed this course. I learned a great deal, and particularly enjoyed the programming assignments. Looking forward to starting course 2.
par John W•
Really enjoyed watching the lectures and Prof Roughgarden's explanations. He did a good job diving just deep enough into the math without losing me.
par Liam Y•
The course is challenging but rewarding. If you take diligent notes and make sure you rewatch videos as needed it yields a great deal of knowledge.
par Rush G•
Remember that the course is based and more focused on the analysis part rather than the actual implementation of the algorithm part. Tim is genius
par Mohd S A•
Great professor, deep dives into key theorems, which bolsters confidence in the subject. Even complex theorem is taught in a friendly manner.