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,256 ratings
802 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:

601 - 625 of 782 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Mayank J

Apr 8, 2018

awesome/...

By HIMANSHU T

Mar 4, 2018

Good Course

By Jianghua F

Sep 15, 2017

NICE COURSE

By Sergey K

Sep 10, 2017

Awesome!!!!

By Rambabu Y

Dec 31, 2016

Very Useful

By Ahmad e D

Nov 6, 2020

🔥🔥🔥🔥🔥

By 雷京颢

Feb 28, 2018

brilliant!

By Chris G

Nov 1, 2017

Fantastic.

By Mingzhe H

Sep 24, 2017

Very good.

By Marcin G

Sep 24, 2017

Excellent!

By Ziyan H

Sep 2, 2017

excellent!

By sai k

Aug 8, 2017

IT'S GREAT

By YangMiao

Dec 4, 2016

Cool class

By Akshat C

Apr 4, 2020

LOVED IT!

By Mohini A

Feb 19, 2019

excellent

By Syed S B

Feb 7, 2019

Excellent

By clayton w

Feb 2, 2019

excellent

By Nikhil N P

Oct 27, 2018

loved one

By Yue W

Sep 5, 2017

Amazing!!

By SUNSHENG G

May 22, 2020

Awesome!

By Neo

Apr 12, 2019

perfect!

By Bing A

Jun 4, 2018

Awesome!

By DURGAM R K

Jan 12, 2018

Fabulous

By ryan

Sep 28, 2017

awesome!

By Gireesh N

May 27, 2017

Awesome!