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,998 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:

176 - 200 of 953 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Güneş A

Mar 18, 2020

By Vinayak G B

May 27, 2018

By Tighe B

Dec 12, 2020

By Prakhar K

Oct 5, 2020

By Fabien T

Jun 2, 2017

By Jacob C

Jan 11, 2022

By Abdul S

Jun 28, 2018

By Sayan P

Feb 18, 2020

By Christopher J V

Jul 1, 2017

By Yx L

Aug 19, 2018

By Adam F

Feb 26, 2017

By Alex K

Dec 27, 2020

By M S K V

May 22, 2020

By Anya S

Jun 16, 2019

By Barunkumar M

Jun 20, 2017

By YEH T P

Jan 6, 2018

By Pavlos C

Jan 3, 2019

By navin m

Nov 10, 2020

By Srikar V

Aug 10, 2019

By Prateek P

Apr 4, 2021

By Euge R

Apr 8, 2018

By THARANGINI S

Jul 10, 2017

By Sakshama G

Jul 6, 2020

By 谷心洋

Jan 11, 2020

By Salvador N

Mar 25, 2020