Learner Reviews & Feedback for Divide and Conquer, Sorting and Searching, and Randomized Algorithms by Stanford University

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.

The course was intense at times, specially the Randomized Contraction Algorithm. Conceptually, it was fine, but the implementations took some serious effort.

It is Really an amazing Course, mind blowing, very informative, It gives me the complete understanding merge sort and quick with best mathematical analysis.

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.

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.

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.

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!

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.

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).

Can we do better?

Yes.

Search for best optimised way using Divide and Conquer..

Thanks to Tim (instructor) for creating such a great interactive program.

I am very lucky to take this course. I learned many new and interesting things from respected sir. In last, I like to thank him from core of my heart.

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)!

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.

I thoroughly enjoyed this course. I learned a great deal, and particularly enjoyed the programming assignments. Looking forward to starting course 2.

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.

Very informative and challenging course. The instructor explained everything in very detailed and precise manner. Finally it is a great course.!

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.

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

Hi,

Great professor, deep dives into key theorems, which bolsters confidence in the subject. Even complex theorem is taught in a friendly manner.

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.

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.

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.

Professor Roughgarden explains everything clearly and is engaged in the topic. His excitement about algorithms comes though in his teaching.