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
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
This course is part of Algorithms Specialization
Instructor: Tim Roughgarden
Access provided by Hassan II University of Casablanca
255,501 already enrolled
Gain insight into a topic and learn the fundamentals.
4.8
(5,313 reviews)
Intermediate level
Some related experience required
Flexible schedule
2 weeks at 10 hours a week
Learn at your own pace
94%
Most learners liked this course
Skills you'll gain
Details to know
Shareable certificate
Add to your LinkedIn profile
Assessments
9 assignments
Taught in English
See how employees at top companies are mastering in-demand skills
Build your subject-matter expertise
This course is part of the Algorithms Specialization
When you enroll in this course, you'll also be enrolled in this Specialization.
- 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
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
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor
Instructor ratings
4.7 (704 ratings)Offered by
Why people choose Coursera for their career
Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
Learner reviews
4.8
5,313 reviews
- 5 stars
82.77%
- 4 stars
13.58%
- 3 stars
1.88%
- 2 stars
0.62%
- 1 star
1.12%
Showing 3 of 5313
MK
5
Reviewed on Sep 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 :-)
MA
5
Reviewed on Jun 22, 2020
I found the course's material quite challenging and mathematically rigorous. I really enjoyed the lectures and programming assignments. Now I'm starting with the second course of the series.
VP
5
Reviewed on 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
Explore more from Computer Science
Stanford University
Stanford University
University of Colorado Boulder
Stanford University