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:

951 - 975 of 1,001 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By hoseop k

•

Dec 11, 2023

very tough challenge but worth for effort

By Simon R

•

Feb 13, 2020

Interesting and well explained. Well done.

By Deepika G

•

Apr 26, 2019

Loved the content and detailed lectures.

By Padala R

•

Nov 2, 2022

i have good experience in this course

By metikala d

•

Nov 1, 2022

I have good experience in this course

By Toader A

•

Dec 6, 2020

Mentor help is almost non-existent.

By Dipankar M

•

May 10, 2020

Very nice course with good faculty.

By de P S

•

Aug 8, 2020

interesting and challenging course

By Suhui L

•

Apr 24, 2022

The profofessor speaaks too fast

By Artem S

•

Apr 23, 2017

Sometimes too much mathematics.

By Sanul R

•

Sep 19, 2018

MORE OF THEORY LESS OF SOLVING

By bhagyshri s

•

Sep 14, 2022

very good aproch explained

By Michael L

•

Dec 19, 2018

This course is excellent...

By Shouvik G

•

Aug 3, 2018

good.but, he is so fast!

By Tejas P

•

Jun 14, 2018

well explained sir..!!!

By Tabrez M

•

Apr 28, 2020

good explanation

By aashirvad s

•

Nov 11, 2022

everything good

By 张之晗(ZhiHan Z

•

Aug 27, 2017

so challenging

By Akshar K

•

Dec 2, 2022

good course

By Shuvro D

•

Sep 10, 2021

good course

By Thành N K

•

Jun 29, 2019

very hard

By Prachi M

•

Jun 25, 2017

Excellent

By E.Naveen K

•

Nov 30, 2016

Great

By Parag K D

•

Apr 3, 2022

good

By Bianca D

•

Jan 26, 2019

Took me way more than 7 hours/week to go through course materials and complete the problem sets and programming assignments. Closer to 10. In general the estimates for how much time each assignment takes is way off (often claiming on the order of minutes, when the reality is for most students (myself included) it is likely on the order of hours).

That said, the programming assignments were challenging and fun (especially trying to do them in JavaScript), and I feel much more comfortable with recursion and Big-Oh.

The forums for the current session are not very active, but there are a lot of old posts from past offerings of the course, and I found that most of the time others had similar questions to me.

The textbook was helpful, but it pretty much has the same content as the lectures with maybe some extra practice and challenge problems. Unfortunately not all solutions to those problems are available, which can be very frustrating (I noticed at least one practice problem with no solution was used on the final exam, so that’s probably why...).

This course is a little more academic than practical in my opinion as a software engineer, but you have to start somewhere.