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
4,055 ratings
750 reviews

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 14, 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.

FR

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

Filter by:

576 - 600 of 734 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By SAI K

Aug 08, 2017

IT'S GREAT

By YangMiao

Dec 04, 2016

Cool class

By Akshat C

Apr 04, 2020

LOVED IT!

By Mohini A

Feb 19, 2019

excellent

By Syed S B

Feb 07, 2019

Excellent

By clayton w

Feb 03, 2019

excellent

By Nikhil N P

Oct 27, 2018

loved one

By Yue W

Sep 05, 2017

Amazing!!

By SUNSHENG G

May 22, 2020

Awesome!

By Neo

Apr 12, 2019

perfect!

By Bing A

Jun 05, 2018

Awesome!

By DURGAM R K

Jan 12, 2018

Fabulous

By ryan

Sep 28, 2017

awesome!

By Gireesh N

May 27, 2017

Awesome!

By De-Wyse

Nov 26, 2016

Helpfull

By Aditya S

Oct 25, 2018

awesome

By DEEPAK M G

Jun 08, 2017

Awesome

By Cesar F C M

Mar 23, 2017

awesome

By Om P

Jan 11, 2017

awesome

By Rainey C

Mar 14, 2018

Greet!

By Surjya N R

Feb 24, 2020

Happy

By 林锦坚

Dec 03, 2019

Nice!

By Jingyuan W

Nov 12, 2019

Great

By Abhijay M

Aug 11, 2019

great

By Pratik T

Jul 04, 2019

dgsdg