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

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.

Tim is too good in explaining concepts, course is very detailed with very good quality assignments which gives good understanding of theory.

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

Amazing course! Helps tremendously in solving coding questions during interview. Learn the concepts from here and do LeetCode for practice.

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.

Great explanations, a formal course with an informal style. The fact that you can do the assignments in any programming language is a plus.

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

The lectures are first-class. Detailed on what I need and brief on unimportant stuff. The entire course is logically coherent and precise.

This course helps me a lot. The teacher is very good. I'll learn his next course right away. I believe I can improve my knowledge here.

A very good course! Just feel excited and motivated to learn algorithms! Now I am determined to be a computer science major in college.

it was awsome!! one of the best courses and materials regarding algorithms i have taken!

thanks a lot!

totally worth my time and money =)

Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.

One of the best courses I've ever studied. Very clear explanation, no "strange" or "unexplained" math. Provides a lot to think about!

Excellent course. The instructor thoroughly motivated the concepts and taught the subject in a way that was insightful and enjoyable.

Very well done and clear even for people without a computer science background. Strongly suggested to anyone interested in algorithms

Well explanatory lectures with challenging programming assignments with a benefit to code in any language. Over all a great course !