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

226 - 250 of 952 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Yann F

Dec 30, 2019

By João R W S

May 25, 2017

By Kandarp K V

May 14, 2020

By Александр М

Oct 22, 2017

By ASHISH K

Mar 15, 2018

By Yasar A A

Mar 29, 2020

By LIU C

Mar 26, 2020

By Sukhdev S

Jul 31, 2017

By Rishi G V

Nov 29, 2019

By Matt L

Jul 19, 2018

By Thomas L

Jan 25, 2021

By John C

Jan 12, 2020

By Parshwanath D

Jul 29, 2018

By Jayana G

Aug 8, 2021

By Abhishek V

Jan 3, 2017

By Mohamed B

Nov 3, 2021

By Peshotan I

Aug 7, 2018

By Mayur P

Jun 3, 2020

By CSE-B-136 S k

Jun 3, 2021

By andrew

Jun 18, 2019

By Minsub L

Apr 6, 2019

By Becci D

Mar 30, 2017

By John W

Jul 7, 2017

By Kuruppu A L O K A

Jun 6, 2021

By Liam Y

Jul 30, 2017