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
5,224 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

SK

Invalid date

I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.

CN

Invalid date

Since I am relatively new to computer science, this course is a little bit hard.

But, overall it's ok and the course also mentioned the similar material is taken by sophomores, juniors and seniors.

Filter by:

801 - 825 of 997 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By DURGAM R K

Jan 11, 2018

Fabulous

By ryan

Sep 28, 2017

awesome!

By Gireesh N

May 27, 2017

Awesome!

By De-Wyse

Nov 26, 2016

Helpfull

By Zixuan Y

Feb 1, 2022

Awesome

By Duy M T

Jan 26, 2022

so good

By отправить п

Jul 9, 2021

love it

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 (

Jan 11, 2017

awesome

By Akshay Y

Nov 18, 2022

thanks

By Rohan B

Nov 17, 2022

i done

By Ruining Z

Mar 13, 2018

Greet!

By Aleks D

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 Shama M

Jul 28, 2024

good

By sudha r

Dec 3, 2023

good