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:

876 - 900 of 1,001 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Emin E

•

Jan 27, 2018

It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.

By Pablo J

•

Aug 28, 2019

understand that this is intended to be cross code language information, but would also be nice to see examples of non-pseudo code and implemented into at least one language

By Xiaoliu W

•

Jul 12, 2020

Nice material. Wish the instructor can go over some part of the material a little slower. Also it would be nice if the solution of the optional questions can be provided.

By A.Bashar E

•

May 9, 2017

Great course for who is seeking to learn new algorithms and their analysis specially the randomized algorithm. but its videos are kind of long compered to other courses.

By Ivan C

•

Nov 13, 2019

It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.

By Madhumala J (

•

Mar 27, 2019

Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same

By dmitriy m

•

Apr 28, 2018

It would be better to have more test cases linked to programming assengments. Hoppefully, there is a github branch with that already... but better to merge it to here

By Justin S

•

Jan 29, 2019

High rank because the instructor really makes the material come alive. Not a 5-star since I wish there was more supporting materials to accompany the course. Thanks!

By Mayank K

•

Jan 16, 2020

Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.

By Mingming L

•

Jun 30, 2022

These are good lectures, but you need to spend a lot of time to digest what the teacher really means and research some basics. It is not friendly for beginners.

By Himanshu G

•

Dec 30, 2017

great course but it would be better if you ask students to submit their code and give limits and various test cases like an actual programming contest.

By aditya s c

•

Jan 25, 2019

very good teaching of algorithms.however a little help for coding those would be appreciated.(in my case i am dealing with graphs for the first time).

By wenqin s

•

May 27, 2020

Overall experience is well, the probability overview was fast, require deep understanding with probability and statistics in discrete model.

By Diego F

•

May 16, 2022

El curso se me hizo incomprensible sin utilizar el textbook. Pero una vez empecé a leerlo mientras hacía el curso, se me hizo más sencillo.

By Sergey Y

•

Mar 24, 2019

Content is great. But handwriting is hard to understand clearly for non-native english speakers. I expected good quality of presentations.

By VIBIN V

•

Jul 28, 2018

excellent course

slightly fast paced and optional exercises are challenging . one should solve those as well to get in depth practice.

By Saumya S

•

Apr 2, 2020

Teaching is absolutely perfect. (A grade). But the content in this sub-division of the specialization is very much theoretical.

By Soroush B

•

Feb 19, 2020

Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.

By Mohammed S M A

•

Sep 17, 2018

Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.

By Edson S

•

May 9, 2020

Great course.

Tim Roughgarden is an incredible teacher.

You'll learn more using Tim's books on the subject, by the way.

By Taylor N

•

Jul 12, 2018

Good explanations, but more theoretical and math-intensive than practical. Not the best way to prepare for interviews.

By Aldo C

•

Jan 14, 2021

Excelente curso, lo deje un tiempo porque no me podía hacer el ejercicio 3 de programación pero fue por no leer bien.

By Deleted A

•

Apr 12, 2022

Focuces in indepth mathimatical insight and analysis of algorithms.

Doesn't depend on a single programming language

By Deleted A

•

Mar 28, 2020

One of the best courses without a doubt!. Although some topics course require more deep / comprehensive discussion

By Yooya

•

Sep 5, 2019

The pace was kind of fast for learners with little base, better to have more reading to facilitate understanding.