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:

876 - 900 of 951 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Rui Z

Jan 12, 2019

By Priyanshu J

Apr 4, 2020

By Rohan K

Sep 12, 2020

By Joey

Jul 1, 2020

By Nikhil S

Dec 21, 2019

By Tianyi Z

Jul 16, 2018

By Lucas P

Jan 1, 2019

By Osmar P

Feb 10, 2021

By Dieter V

Nov 16, 2020

By Sukhesh B

Nov 14, 2016

By Sriram R

Nov 13, 2016

By Aman S

Apr 3, 2020

By Ashish U

Jul 25, 2019

By Aditya K

Jun 29, 2018

By Yusuf K

Jan 20, 2018

By Keith M

Nov 17, 2020

By Patel P N

Mar 4, 2022

By adham E

Jun 3, 2020

By Dharmesh

Apr 7, 2020

By Fatoumata F

Apr 23, 2018

By Rhiddhi P D

Jan 15, 2022

By Hassan N

Mar 1, 2017

By Георгий Г

Nov 13, 2018

By sherif s

Nov 15, 2019

By Vishnu

Dec 31, 2019