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



Divide and Conquer, Sorting and Searching, and Randomized Algorithms
This course is part of Algorithms Specialization

Instructor: Tim Roughgarden
Access provided by New York State Department of Labor
250,107 already enrolled
(5,287 reviews)
Skills you'll gain
Details to know

Add to your LinkedIn profile
9 assignments
See how employees at top companies are mastering in-demand skills

Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate


Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV
Share it on social media and in your performance review

There are 4 modules in this course
Introduction; "big-oh" notation and asymptotic analysis.
What's included
13 videos3 readings2 assignments
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
What's included
11 videos2 readings2 assignments
The QuickSort algorithm and its analysis; probability review.
What's included
9 videos1 reading2 assignments
Linear-time selection; graphs, cuts, and the contraction algorithm.
What's included
11 videos3 readings3 assignments
Instructor

Offered by
Why people choose Coursera for their career




Learner reviews
5,287 reviews
- 5 stars
82.82%
- 4 stars
13.59%
- 3 stars
1.87%
- 2 stars
0.62%
- 1 star
1.07%
Showing 3 of 5287
Reviewed on Sep 14, 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.
Reviewed on Jan 27, 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.
Reviewed on Apr 27, 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
Recommended if you're interested in Computer Science
Stanford University
Stanford University
University of Colorado Boulder
Stanford University

Open new doors with Coursera Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose Coursera for Business
Upskill your employees to excel in the digital economy