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,182 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:

401 - 425 of 988 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Adeesh A

•

Apr 1, 2020

Great explanation . All the algorithms are thought with proof of time complexity

By Aditya K J

•

Mar 30, 2018

A comprehensive courses with details on correctness,implementation and analysis.

By Udhayakumar S

•

May 31, 2017

Understood very much about random algorithms. Appreciate the rigour in analysis.

By Kevin H

•

Oct 29, 2020

Great Course for really diving into data structures and algorithms. Thanks Tim!

By Eyes R

•

May 12, 2018

Outstanding introduction to algorithms with great practice problems and quizzes

By Yifan W

•

Oct 23, 2016

It's an amazing courses aiming to high-level and fast-pace algorithmic thinker.

By Mafruha C

•

Nov 12, 2017

This cource is a path of my passion to enjoy the intelligent thought and being

By Gaurav K

•

Dec 13, 2016

Sir Tim Roughgarden teaches very straight forward and easy .I like the course.

By Rajat N K

•

Nov 14, 2019

Extremely important course if you are looking to revise your algorithm skills

By Mostafa Z

•

Nov 8, 2019

I have really learned a lot and made me explore different topics

Thanks a lot.

By Ramazan U

•

Sep 18, 2017

Great course! Beginners should be ready to put in some serious effort though.

By RAJA K V

•

Jul 8, 2023

Really , the course was Amazing. I learned so many algorithm, techniques etc

By George Z

•

Jul 21, 2021

The graph theory part is kind of confusing and might need more explanations.

By Anton B

•

Nov 19, 2018

Handwriting is difficult to understand sometimes but the content is awesome.

By Armando J B F

•

Oct 19, 2018

Excellent, in-depth course. The use of randomness was indeed 'illuminating'.

By shivaranjani g

•

Jun 16, 2021

amazing course.learn lot of things. enjoy problem solving using programming

By Jiaxiao W

•

Mar 2, 2019

very clear and organized course. I learned a lot from it. Thank you so much

By Haochuan W

•

Jan 23, 2019

Best online course I've taken. You can possibly cross out the "online" too.

By Stjepan H

•

Apr 22, 2021

One of the best courses I attended. It is difficult, but totally worth it!

By Jiangbo W

•

Sep 30, 2019

Appropriate amount of content, but a little hard. After all it's Stanford!

By Udaya B C

•

Aug 16, 2019

Best professor, these concepts helped me a lot in competitive programming.

By Aakash S

•

Apr 14, 2018

Concepts are very well explained and the quality of quizzes are top-notch.

By Dima

•

Mar 13, 2017

I like this course a lot. Going to learn everything in the specialization.

By Mohammad N Z

•

Nov 20, 2016

This is a great course for who doesn't have a computer science background!

By BRUCE

•

Apr 23, 2018

Finished part I, keep going! This is one of the best courses in Coursera.