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,320 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

EE

Jan 26, 2018

It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.

GE

Apr 7, 2018

I would like a better balance workload from week to week. In my experience it increase every week, so last week I was in a rush, not even being able to go through the optional material.

Filter by:

826 - 850 of 1,019 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Ruining Z

Mar 14, 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 Priyanka P

Mar 27, 2025

best

By Shama M

Jul 28, 2024

good

By sudha r

Dec 3, 2023

good

By Chenghao X

Jul 27, 2023

Good

By Neelotpal C

May 9, 2023

Good

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

Jun 3, 2017

Best

By ABDUFATTOH F

Apr 23, 2025

zor

By 何浩源

Jul 19, 2019

喵儿额

By Julia

Jun 2, 2018

WOW

By Xie R

Feb 10, 2019