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

Best Course for Programmers. But this course needs some programming prerequisites to understand the concepts clearly.

Good course to get started with algorithms. I am already a programer, and still learn a lot from this course. Thanks!

Great course for those who would like to become better developers and learn basics of data structures and algorithms

Although some concepts were a bit too hard to chew, this is a great start for someone who's new to computer science.

The course is really good. Helping me to grasp the basic concepts of algorithm and to refresh the algorithms skills.

excellent content. Learned a lot! Proofs can be a bit dull at times. But that probably simply lies in their nature.

This was an amazing course and it allowed me to learn complex algorithms and introduced me to algorithmic thinking

It really helped me understand the concept of algorithms. I confess that I have a new perspective of an algorithm.

Great course to learn about different algorithm design paradigms and dig into the world of randomized algorithms.

Very intellectually stimulating. The problems were thought-provoking and assessed understanding very effectively.

Great teacher. Coming from a science background myself, I like that the math is not watered down in the analysis.

What an amazing and insightful course. the min algorithm totally blew my mind randomized algo are simply elegant

Wonderful explanations. The companion book helps a lot to review material and have it always fresh in your mind.

Awesome course. Learnt a lot about the theory behind a randomized algorithm. Karger's min cut was a revelation.

He can tend to go off topic and waste time in an effort to be exactly exact, but other than that, great course.

Fascinating course! This may be an unpopular opinion, but I loved the mathematical analysis of the algorithms.

The material is explained really well and the programming assignments are challenging but ultimately solvable.

Универской математики хватает для понимания (Матанализ незамысловатый + теорвер базовый). Мне понравился курс

Excellent, great explanations and good pace. Exercises quite challenging for a newbie but you'll learn a ton.

Slides are concise. By going through all the slides, I'm already able to grab most of the information needed.

Some of the homeworks were difficult, but implementing the algorithms is the best way to really learn them.

A little hard to understand, but if you have done your preparation readings, it would be extremely helpful!

Great Course! Everyone should take this cousere in order to become a skilled programmer.

Not for begginers.

Amazing course. Tim is a very charismatic lecturer and it is always a pleasure to get back to his lectures.

Tim Roughgarden teaches with wit and depth. Speaking with idiomatic verve, he injects life into Algorithms!