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

Nice CS fundamental course with clear logical reasoning and proof. The instructor is good at explaining mathematical proofs step-by-step, making the course materials much easier to understand. Highly recommend it to people wishing to learn about how algorithms work!

Course was amazing - the one thing is I found the problem sets to typically be very difficult. Would be nice to have a similar set of problems + solutions available to better understand after we get something wrong.

Thank you for the time you put into this course.

As an Electrical Engineer, until completing this course, I felt a little uncomfortable talking with computer scientists about algorithms, although I have been programming for about 20 years. Now I feel comfortable discussing algorithms. Really enjoyed the course.

It is an awesome experience.Most likely the programming assignment gives me a boost.And the Karger's Algorithm problem of minimum cut was nice.It really take a lot of tie to solve and think.But finally I am able to pass it .After all a very good experience.

Professor Roughgarden makes algorithms cool. With his passion for the topic you can't help but get excited about it too. I feel like I got a deep understanding of the topics covered versus just learning a recipe to sort an array. Looking forward to more.

This course really helped me understand how Divide and Conquer Algorithms work. I liked the programming assignments since they really force you to program it on your own and that is the best way to really master algorithms. It was so helpful, thank you!

This course really is something else. It enhances the way you think, developes new thinking of old problems. The professor knows how to explain certain things that look more complicated and makes it look easier to the uninitiated persons in this course

Great course! It was very well planned an oriented for experimented programmers that need that pinch of salt needed to get the best in their codes. I strongly recommend to use TDD in the development of the programming practices.

A resume?: it's a MUST.

The best course I've taken on any MOOC by far. I'm satisfied with both its depth and professor's intuitive teaching. Assignments are also challenging, deeply connected to the material. Strongly recommend to any like me who is new to algorithms.

The teacher (Tim Roughgarden) is simply excellent!

There's not only basic problems which is very cool and interesting, plus the lecture is interactive and challenging through the different quiz.

I Highly recommend this course,

Thanks for sharing.

A strong start to understanding the complexity and analysis of algorithms. The course requires existing knowledge of algorithms and programming in general. Although tough, this course is a great insight into gaining a firm grip on algorithms.

MR. tim is a brilliant tutor and his way of presenting is unmatchable.i didn't had any kind off troublesome during this whole course.overall i learned so many concepts from this course.thanks tim sir and coursera for this truly appreciated!!

An interesting and challenging course.

Good for learning the basics of algorithms for someone with a good background and mathematics (including proofs) background.

The prof is fun and light to listen to... hence the videos are not tedious.

it is very important to learn algorithms as it is truly said it is heart of computer programming .. I am very happy and thanks for offering such a course to coursera and have just started hope will learn something so that it will help !!!!

Well-designed. Keeps the learner engaged, and excited to learn by giving detailed analysis of each algorithm, without overshadowing the beauty of the algorithm. A very good introductory course to algorithms! The teacher was just amazing!

Very fair course and quite demanding, especially if you want to understand the maths. You certainly will gain to follow Mr Tim Roughgarden during those four weeks, even if you think that you already are a professional computer scientist.

This course is very good to increase your logical programming. Problem solving skills improved.Great explanation of concept of probability.Instructors are very good.Thank you cousera to provide such a knowledgeable course of algorithms.

For a person who has been learning programming for close to a year now, this course was a challenge. There is a ton of content covered and the course requires you to really know the material in order to pass the quizzes and final exam.

This is a brilliant course on algorithms, shines light on seemingly basic concepts in a very detailed and practical manner.

The programming assignments are fairly challenging, one must have some programming experience to code them up.

I do programming for a living, but I am going though this specialization to refresh my memory and competence in algorithms, as a base for other more advanced courses. Following Tim's lectures is very stimulating. I enjoyed it a lot!

The tutorials were very detailed. The tests required me to revisit the videos again n and again. If We can have some practice questions which are similar and help us practice concepts many times would help us retain the knowledge.

This course taught me the fundamentals of algorithm analysis and how to design divide-and-conquer, sorting, and randomized algorithms. I would recommend this course to anyone interested in getting their start in algorithm design.

I really like the course content and the way professor teaches. Programming assignments are really good as they just don't ask you to code up an algorithm but asks in depth questions like number of comparisons made in each step.

This course has often been difficult for me, which means I learned a lot. Many-many thanks to Prof. Roughgarden for the challenging topics so nicely explained, and to all the mentors and fellow students from Discussion forum :)

Pretty amazing course. The book "Algorithms Illuminated" by Dr. Tim Roughgarden makes you greedy to learn more about algorithms. Some of the analogies he presented to explain the concepts were hilarious and makes it a fun read.