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

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.

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.

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!

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

TD

5.0Reviewed May 14, 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!

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.

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.

RK

5.0Reviewed Jun 14, 2021

A Great course for someone who is a beginner and is really dedicated towards learning Algorithms! I loved the instructor's explanations for the proof of correctness of algorithms.

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

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.

KS

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

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.