Learner Reviews & Feedback for Divide and Conquer, Sorting and Searching, and Randomized Algorithms by Stanford University
About the Course
Top reviews
NE
Nov 6, 2016
Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.
DT
May 26, 2020
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
326 - 350 of 1,019 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms
By Rihards J
•Dec 19, 2020
Great course for those who would like to become better developers and learn basics of data structures and algorithms
By Daniel R
•Aug 16, 2019
Although some concepts were a bit too hard to chew, this is a great start for someone who's new to computer science.
By Pritam B
•Oct 12, 2017
The course is really good. Helping me to grasp the basic concepts of algorithm and to refresh the algorithms skills.
By Janis S
•Sep 25, 2020
excellent content. Learned a lot! Proofs can be a bit dull at times. But that probably simply lies in their nature.
By Aakash K (
•Aug 6, 2020
This was an amazing course and it allowed me to learn complex algorithms and introduced me to algorithmic thinking
By Alan R M
•Jun 7, 2018
It really helped me understand the concept of algorithms. I confess that I have a new perspective of an algorithm.
By Raghusrinivasan J
•Feb 17, 2021
Great course to learn about different algorithm design paradigms and dig into the world of randomized algorithms.
By Garret N
•Oct 14, 2020
Very intellectually stimulating. The problems were thought-provoking and assessed understanding very effectively.
By Garrett M
•May 10, 2018
Great teacher. Coming from a science background myself, I like that the math is not watered down in the analysis.
By Balaji R
•Mar 21, 2020
What an amazing and insightful course. the min algorithm totally blew my mind randomized algo are simply elegant
By Alberto C
•Dec 10, 2017
Wonderful explanations. The companion book helps a lot to review material and have it always fresh in your mind.
By Shinjan T
•Sep 11, 2019
Awesome course. Learnt a lot about the theory behind a randomized algorithm. Karger's min cut was a revelation.
By Shawn M
•Apr 29, 2019
He can tend to go off topic and waste time in an effort to be exactly exact, but other than that, great course.
By placido d b
•Feb 25, 2022
Great, this course is not simply a course on how algorithms are made but the essence of each one is explained.
By Keerthana S
•Jun 22, 2018
The material is explained really well and the programming assignments are challenging but ultimately solvable.
By Влад А
•Oct 12, 2021
Универской математики хватает для понимания (Матанализ незамысловатый + теорвер базовый). Мне понравился курс
By Jorge B
•Oct 14, 2017
Excellent, great explanations and good pace. Exercises quite challenging for a newbie but you'll learn a ton.
By Jiacheng J
•Aug 3, 2017
Slides are concise. By going through all the slides, I'm already able to grab most of the information needed.
By Pedro F G S
•Jul 1, 2020
Some of the homeworks were difficult, but implementing the algorithms is the best way to really learn them.
By yiye f
•Jun 8, 2017
A little hard to understand, but if you have done your preparation readings, it would be extremely helpful!
By Constantin M
•Jun 3, 2017
Great Course! Everyone should take this cousere in order to become a skilled programmer.
Not for begginers.
By Aliaksei P
•May 16, 2017
Amazing course. Tim is a very charismatic lecturer and it is always a pleasure to get back to his lectures.
By Subhashis M
•Jan 9, 2017
Tim Roughgarden teaches with wit and depth. Speaking with idiomatic verve, he injects life into Algorithms!
By Saurav k
•Oct 16, 2022
The materials of the course are very straight forward and brilliantly explained by Sir Tim Roughgarden.