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 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 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.
par Max L I•
Tim Roughgarden does an amazing job at explaining this topic. The only very very small downside is, that video and voice are not always in sync.
An excellent course. Frees your mind from the high school paradigm of procedural approach to Maths at the expense of pure, ground up reasoning.
par Péricles L M•
I had an amazing experience and a good review to main topics on Algorithms theory and I learned some nice new algorithms like Karger Algorthm.
par Himanshu G•
Excellent course. Professor Roughgarden did a splendid job of explaining the most intricate details in a way understood by even weak students.
This course is about following topics: large integers multiplication, merge sort, quick sort, master method and Karger's min-cut algorithms.
par Ian E•
Professor Roughgarden explains everything clearly and is engaged in the topic. His excitement about algorithms comes though in his teaching.
par Piyush M•
Tim is too good in explaining concepts, course is very detailed with very good quality assignments which gives good understanding of theory.
par shehab a s•
this very fantastic course, the one thing in this course make it the best is explaining the topic in way why this work this way not another
par Vishal H•
Amazing course! Helps tremendously in solving coding questions during interview. Learn the concepts from here and do LeetCode for practice.
par Caique D S C•
Very good, just could have more programming exercises.
And It seems to me that the audio of the lectures is a little bit ahead of the video.
par Nicolas T•
Great explanations, a formal course with an informal style. The fact that you can do the assignments in any programming language is a plus.
par Johnathan F•
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.