Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford

It was an awesome and challenging course.And ,the lecturer Mr.Tim Roughgarden did introduced the gist that I need.So ,of course, I owe him a big thank.Thank you all.

The course is very good and interesting. There are many theories and ideas about real implementation on real projects. I am honored to be educated by Professor Tim.

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.

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.

Very well designed, structured and delivered. I enjoyed the videos and learned a lot from the lectures, quizzes, forum and programming assignments. Great course.

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!

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.

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.

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.

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

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!

The best algo course i've ever taken.Tim sir explains important points in a smooth way. Highly recommond this course to each and every CS and SE student.

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.