Chevron Left
Back to Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Learner Reviews & Feedback for Divide and Conquer, Sorting and Searching, and Randomized Algorithms by Stanford University

4.8
stars
5,244 ratings

About the Course

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts)....

Top reviews

KS

Sep 13, 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

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

Filter by:

326 - 350 of 1,002 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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 8, 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 22, 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 26, 2022

Great, this course is not simply a course on how algorithms are made but the essence of each one is explained.

By L H

Feb 17, 2021

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

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 4, 2017

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

By PedroGiff

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.

By Vaibhav

Aug 28, 2021

Very nice introduction to recursion and elegant explanation of the mathematics behind complexity analysis!

By BingyueBei

May 12, 2021

Brilliant explanation over the course materials! Now I feel more confident doing mock interview questions!

By Andrey M

Jun 29, 2020

Thank you Tom. This is a great course. I got a real vision of the algorithms and started to understand it.

By Joseph R

Apr 5, 2018

Can you do better in those technical interviews?

Yes! if you take this course.

I recommend buying the book.