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,444 ratings
861 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 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:

676 - 700 of 841 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By ryan

Sep 28, 2017

awesome!

By Gireesh N

May 27, 2017

Awesome!

By De-Wyse

Nov 26, 2016

Helpfull

By jatin s

Aug 9, 2020

Awesome

By Aditya S

Oct 25, 2018

awesome

By DEEPAK M G

Jun 7, 2017

Awesome

By Cesar F C M

Mar 23, 2017

awesome

By Om P

Jan 11, 2017

awesome

By Ruining Z

Mar 14, 2018

Greet!

By Дубейковский А А

Aug 18, 2020

cool!

By Surjya N R

Feb 24, 2020

Happy

By 林锦坚

Dec 3, 2019

Nice!

By Jingyuan W

Nov 12, 2019

Great

By Abhijay M

Aug 11, 2019

great

By Pratik T

Jul 4, 2019

dgsdg

By CarlosTsui

Jul 13, 2017

good!

By Juspreet S

Oct 30, 2016

Nice!

By Zhang T

Feb 8, 2021

nice

By Pranaya R

Sep 10, 2020

nice

By 이민준

Jul 4, 2020

nice

By XIANG Z

Jul 4, 2020

Nice

By lokesh v

Sep 25, 2019

GOOD

By Avadhesh Y

Sep 14, 2019

good

By Siddhant K

Jun 3, 2017

Best

By 何浩源

Jul 19, 2019

喵儿额