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

1 - 25 of 934 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Thomas N

Feb 9, 2019

By Divij S

Jan 23, 2018

By Ian D

Jan 3, 2019

By Erin H

Jun 19, 2018

By Joshua S

Oct 3, 2018

By Bharath K N

Oct 16, 2018

By Bakhtiar R

Nov 3, 2017

By Pablo S

Dec 30, 2019

By Amit

Nov 2, 2016

By Vladimir M

Oct 18, 2019

By Jyovita C

Jun 11, 2017

By LUIZ O V L D G

Oct 1, 2019

By Matthieu D

Sep 13, 2018

By Adam L

Jun 11, 2017

By Pulkit K

Jun 11, 2018

By Faiz R

Mar 16, 2017

By Wang Q

Dec 13, 2020

By Maxim A

Apr 9, 2021

By Z T

Oct 2, 2020

By Sandeep P

Aug 6, 2018

By Karan S

Sep 14, 2018

By Sergey S

Mar 25, 2019

By Cole C

Jan 14, 2021

By abusaleh i

Mar 14, 2019

By Sergey T

May 3, 2020