Back to Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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).

Status: Theoretical Computer Science
Status: Data Structures
IntermediateCourse15 hours

Featured reviews

CN

4.0Reviewed Mar 21, 2022

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.

SK

5.0Reviewed Jan 17, 2020

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.

JJ

4.0Reviewed Apr 29, 2017

As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.

VP

5.0Reviewed Apr 27, 2020

Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P

RR

5.0Reviewed Jan 29, 2018

This was going to be a review of material for me, just a refresher. But instead I was exposed to a lot of new concepts and really feel like I got some good experience from it.

SN

5.0Reviewed Mar 26, 2020

I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!

NE

5.0Reviewed Nov 7, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

AC

4.0Reviewed Jan 4, 2020

A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.

FR

5.0Reviewed Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

JR

5.0Reviewed Jul 23, 2020

This was a super interesting and well-taught course. I thoroughly enjoyed learning about and implementing the algorithms taught. I also enjoyed the abundance of extra material.

TD

5.0Reviewed May 15, 2020

This course was outstanding! Big thanks to Tim for explaining difficult concepts in a clear and concise fashion. I can't wait to get started on the next course in this specialization!

II

5.0Reviewed Sep 1, 2017

Amazing course. I learned a lot about algorithms, the implementation of algorithms, time complexity. I also learned a lot about being systematic and purposeful about including any line of code.

All reviews

Showing: 20 of 1,020

Thomas Nguyen
1.0
Reviewed Feb 10, 2019
Divij Sood
2.0
Reviewed Jan 23, 2018
Ian Danforth
1.0
Reviewed Jan 3, 2019
Erin Harris
2.0
Reviewed Jun 19, 2018
Josh Sakwa
5.0
Reviewed Oct 4, 2018
Bharath Kumar Nallakaluva
3.0
Reviewed Oct 17, 2018
Bakhtiar Robbani
1.0
Reviewed Nov 3, 2017
amit upadhyay
1.0
Reviewed Nov 2, 2016
Pablo Sánchez
1.0
Reviewed Dec 31, 2019
Jyovita Christi
5.0
Reviewed Jun 11, 2017
Maxim Andrukhovych
1.0
Reviewed Apr 10, 2021
Luiz Godoy
1.0
Reviewed Oct 2, 2019
Faiz Rabbani
5.0
Reviewed Mar 17, 2017
Vladimir Makushev
5.0
Reviewed Oct 18, 2019
Moushumi Pardesi
1.0
Reviewed May 25, 2021
Wang QC
1.0
Reviewed Dec 14, 2020
Pulkit Kaushik
1.0
Reviewed Jun 12, 2018
Matthieu Darcy
5.0
Reviewed Sep 13, 2018
Adam Loper
3.0
Reviewed Jun 12, 2017
Cole Carroll
2.0
Reviewed Jan 15, 2021