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: Algorithms
Status: Computer Science
IntermediateCourse15 hours

Featured reviews

SK

5.0Reviewed Jan 16, 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.

EE

4.0Reviewed 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.

VP

5.0Reviewed Apr 26, 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

NE

5.0Reviewed Nov 6, 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 3, 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.

II

5.0Reviewed Aug 31, 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.

SN

5.0Reviewed Mar 25, 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!

JR

5.0Reviewed Jul 22, 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.

CN

4.0Reviewed Mar 20, 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.

MK

5.0Reviewed Sep 14, 2019

This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)

GE

4.0Reviewed 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.

JB

5.0Reviewed Jun 15, 2018

Challenging and eye opening to algorithm design paradigms. As a code writer for data analysis in a scientific field, this course really motivated me to delve deeper in this rich field.

All reviews

Showing: 20 of 1,020

Thomas Nguyen
1.0
Reviewed Feb 9, 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 3, 2018
Bharath Kumar Nallakaluva
3.0
Reviewed Oct 16, 2018
Bakhtiar Robbani
1.0
Reviewed Nov 3, 2017
amit upadhyay
1.0
Reviewed Nov 2, 2016
Pablo Sánchez
1.0
Reviewed Dec 30, 2019
Jyovita Christi
5.0
Reviewed Jun 11, 2017
Maxim Andrukhovych
1.0
Reviewed Apr 9, 2021
Luiz Godoy
1.0
Reviewed Oct 1, 2019
Faiz Rabbani
5.0
Reviewed Mar 16, 2017
Vladimir Makushev
5.0
Reviewed Oct 18, 2019
Moushumi Pardesi
1.0
Reviewed May 25, 2021
Wang QC
1.0
Reviewed Dec 13, 2020
Pulkit Kaushik
1.0
Reviewed Jun 11, 2018
Matthieu Darcy
5.0
Reviewed Sep 13, 2018
Adam Loper
3.0
Reviewed Jun 11, 2017
Cole Carroll
2.0
Reviewed Jan 14, 2021