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: Analysis
Status: Design Strategies
IntermediateCourse15 hours

Featured reviews

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!

FR

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

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

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.

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.

JJ

4.0Reviewed Apr 28, 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.

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.

RR

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

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.

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.

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.

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.