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:

901 - 925 of 1,001 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Laxmidhar P

•

Jul 1, 2018

This Course was awesome and it can prove benefit to all the students for designing efficient and fast algorithms.

By Piotr L

•

Feb 14, 2018

Slightly outdated in terms of slides full of handwriting, but knowledge is laid out perfectly fine. Thanks Tim!

By Золотов Д С

•

Jul 24, 2020

The handwritten text was a bit of difficult to read. The rest of the course is just exactly what is needed.

By Pasha B

•

Jan 18, 2018

Would be great to have more verbose assignments check results. But still awesome experience and challenge

By Joseph R

•

May 20, 2023

like the assignments, but I feel that the detail needed to answer the math questions were a distraction

By Youjia W

•

Apr 15, 2022

Very helpful course! If the number of programming exercises can be increased, then it would be perfect!

By Rakibullah S

•

May 25, 2018

Good but some videos on how the algorithms work and the proofs could have been much easier and clearer

By Haoran Z

•

Jun 2, 2017

Great algorithm course, definitely helps people who find reading an algorithm book too boring to read.

By tanish s

•

Apr 17, 2020

accent is difficult to understand for indian students. course is very helpful to grab deep knowledge.

By Tung B D

•

Dec 22, 2021

Interesting course, especially with the analysis part. Programming assignment however is a bit easy.

By Poros S

•

May 6, 2023

Good course for beginners to clear their concepts , basics which help them to build their career.

By Heather F

•

Sep 11, 2020

Great course. It would be nice if there was more detailed feedback on the assignments and quizes.

By Reza M

•

Apr 3, 2022

This course is useful for my thinking and designing fast algorithms for my programming skills.

By S A

•

Dec 22, 2017

Please do not teach graphs before teaching data structures it becomes very tough for students.

By Sahil A

•

Dec 8, 2021

Amazing course live deep knowledge about divide conquer algorithms like merge and Quick sort

By Irene J

•

Apr 11, 2020

It is a little bit hard for people who only have Python background, but still pretty good.

By LAWRENCE S

•

Jun 28, 2019

The talking speed of instructor is too fast. Is there a way to slow down via the control?

By Andres M H C

•

Jan 9, 2021

Very nice course. The professor speak really fast but the subtitles are really helpful

By CHANDAN K S

•

May 5, 2020

instructor speed of telling the concept is very fast so kindly please take care of it.

By Shubham R

•

Aug 24, 2019

It was a great course and I loved joining this. Clearing my many theoretical concepts.

By Rui Z

•

Jan 12, 2019

Very good course! Clear explanations and proofs to help you understand the algorithms.

By Priyanshu J

•

Apr 4, 2020

I would appreciate if implementation of algorithms is also included with this course.

By Rohan K

•

Sep 12, 2020

The instructor was really really fast. Grasping the concepts was a little difficult.

By Joey

•

Jul 1, 2020

Awesome course, I found it very helpful in preparation for my developer interviews.

By Nikhil S

•

Dec 21, 2019

In the very end, it was fun coding the min-cut algorithm and overall I enjoyed this