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:

151 - 175 of 951 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By YANG Y

Jun 19, 2017

By Scez

Feb 20, 2020

By Izhar A

Jun 21, 2021

By Abhinav D

May 23, 2020

By Gonzalo G A E

Mar 13, 2020

By Arvind U

Mar 9, 2017

By Siddharth A

Jul 15, 2020

By Alexandre C

Apr 29, 2021

By Ankur S

May 19, 2020

By Shaun G

Jul 27, 2021

By Alfaz A

Aug 13, 2019

By Code A A

Jan 29, 2019

By amit

Apr 24, 2019

By Nikhil S

Aug 23, 2020

By Shuvam S

Jun 28, 2019

By Freyza F K

Jul 22, 2022

By Denny S

Feb 11, 2022

By Mehmet M G

Oct 6, 2021

By Mariia B

Feb 19, 2021

By Abhinaya N

Dec 13, 2018

By Molderez

Aug 6, 2020

By Shubham D

Nov 20, 2019

By 熊之遥

Apr 9, 2017

By Tzushin H

Jul 29, 2022

By Pawel K S

Apr 4, 2018