This course is part of the Algorithms Specialization

4.8
stars
5,035 ratings

Tim Roughgarden

214,195 already enrolled

Offered By

Algorithms SpecializationStanford University

About this Course

75,047 recent views

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

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 1 of 4 in the

Algorithms Specialization

Intermediate Level

Approx. 16 hours to complete

English

Skills you will gain

Algorithms
Randomized Algorithm
Sorting Algorithm
Divide And Conquer Algorithms

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 1 of 4 in the

Algorithms Specialization

Intermediate Level

Approx. 16 hours to complete

English

Instructor

Instructor rating

4.68/5 (628 Ratings)

Tim Roughgarden

Offered by

Stanford University

Syllabus - What you will learn from this course

Content Rating94%(17,083 ratings)

Week1

Week 1

4 hours to complete

Week 1

4 hours to complete

13 videos (Total 130 min), 3 readings, 2 quizzes

13 videos

Why Study Algorithms?4mInteger Multiplication8mKaratsuba Multiplication12mAbout the Course17mMerge Sort: Motivation and Example8mMerge Sort: Pseudocode12mMerge Sort: Analysis9mGuiding Principles for Analysis of Algorithms15mThe Gist14mBig-Oh Notation4mBasic Examples7mBig Omega and Theta7mAdditional Examples [Review - Optional]7m

3 readings

Welcome and Week 1 Overview10mOverview, Resources, and Policies10mLecture slides10m

2 practice exercises

Problem Set #130mProgramming Assignment #130m

Week2

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 I12mO(n log n) Algorithm for Counting Inversions II16mStrassen's Subcubic Matrix Multiplication Algorithm22mO(n log n) Algorithm for Closest Pair I [Advanced - Optional]31mO(n log n) Algorithm for Closest Pair II [Advanced - Optional]18mMotivation7mFormal Statement10mExamples13mProof I9mInterpretation of the 3 Cases10mProof II16m

2 readings

Week 2 Overview10mOptional Theory Problems (Batch #1)10m

2 practice exercises

Problem Set #230mProgramming Assignment #230m

Week3

Week 3

4 hours to complete

Week 3

4 hours to complete

9 videos (Total 156 min), 1 reading, 2 quizzes

Week4

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 - Algorithm21mRandomized Selection - Analysis20mDeterministic Selection - Algorithm [Advanced - Optional]16mDeterministic Selection - Analysis I [Advanced - Optional]22mDeterministic Selection - Analysis II [Advanced - Optional]12mOmega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]13mGraphs and Minimum Cuts15mGraph Representations14mRandom Contraction Algorithm8mAnalysis of Contraction Algorithm30mCounting Minimum Cuts7m

3 readings

Week 4 Overview10mOptional Theory Problems (Batch #2)10mInfo and FAQ for final exam10m

3 practice exercises

Problem Set #430mProgramming Assignment #430mFinal Exam30m

Reviews

4.8

979 reviews

5 stars
83.06%
4 stars
13.66%
3 stars
1.80%
2 stars
0.57%
1 star
0.89%

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

by NDec 2, 2022

very intansive ,it has really challenged my knowledge level both in english language or in computational mathematics,i feel too configent now.thank Stanford University,thanks Coursera

by EEJan 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.

by VPApr 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

by MKSep 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 :-)

View all reviews

About the Algorithms Specialization

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

More questions? Visit the Learner Help Center.

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

About this Course

Skills you will gain