About this Course

225,829 recent views

Learner Career Outcomes

36%

started a new career after completing these courses

37%

got a tangible career benefit from this course

26%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 17 hours to complete
English

Skills you will gain

AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms

Learner Career Outcomes

36%

started a new career after completing these courses

37%

got a tangible career benefit from this course

26%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 17 hours to complete
English

Instructor

Offered by

Placeholder

Stanford University

Syllabus - What you will learn from this course

Content RatingThumbs Up95%(13,338 ratings)Info
Week
1

Week 1

4 hours to complete

Week 1

4 hours to complete
13 videos (Total 130 min), 3 readings, 2 quizzes
13 videos
Integer Multiplication8m
Karatsuba Multiplication12m
About the Course17m
Merge Sort: Motivation and Example8m
Merge Sort: Pseudocode12m
Merge Sort: Analysis9m
Guiding Principles for Analysis of Algorithms15m
The Gist14m
Big-Oh Notation4m
Basic Examples7m
Big Omega and Theta7m
Additional Examples [Review - Optional]7m
3 readings
Welcome and Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
2 practice exercises
Problem Set #130m
Programming Assignment #130m
Week
2

Week 2

4 hours to complete

Week 2

4 hours to complete
11 videos (Total 170 min), 2 readings, 2 quizzes
11 videos
O(n log n) Algorithm for Counting Inversions II16m
Strassen's Subcubic Matrix Multiplication Algorithm22m
O(n log n) Algorithm for Closest Pair I [Advanced - Optional]31m
O(n log n) Algorithm for Closest Pair II [Advanced - Optional]18m
Motivation7m
Formal Statement10m
Examples13m
Proof I9m
Interpretation of the 3 Cases10m
Proof II16m
2 readings
Week 2 Overview10m
Optional Theory Problems (Batch #1)10m
2 practice exercises
Problem Set #230m
Programming Assignment #230m
Week
3

Week 3

4 hours to complete

Week 3

4 hours to complete
9 videos (Total 156 min), 1 reading, 2 quizzes
9 videos
Partitioning Around a Pivot24m
Correctness of Quicksort [Review - Optional]10m
Choosing a Good Pivot22m
Analysis I: A Decomposition Principle21m
Analysis II: The Key Insight11m
Analysis III: Final Calculations8m
Probability Review I25m
Probability Review II17m
1 reading
Week 3 Overview10m
2 practice exercises
Problem Set #330m
Programming Assignment #330m
Week
4

Week 4

5 hours to complete

Week 4

5 hours to complete
11 videos (Total 184 min), 3 readings, 3 quizzes
11 videos
Randomized Selection - Analysis20m
Deterministic Selection - Algorithm [Advanced - Optional]16m
Deterministic Selection - Analysis I [Advanced - Optional]22m
Deterministic Selection - Analysis II [Advanced - Optional]12m
Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]13m
Graphs and Minimum Cuts15m
Graph Representations14m
Random Contraction Algorithm8m
Analysis of Contraction Algorithm30m
Counting Minimum Cuts7m
3 readings
Week 4 Overview10m
Optional Theory Problems (Batch #2)10m
Info and FAQ for final exam10m
3 practice exercises
Problem Set #430m
Programming Assignment #430m
Final Exam30m

Reviews

TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS

View all reviews

About the Algorithms Specialization

Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.