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 BNP Paribas Cardif 1
258,022 already enrolled
Gain insight into a topic and learn the fundamentals.
5,330 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
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
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
(705 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
- 5 stars
82.73%
- 4 stars
13.60%
- 3 stars
1.87%
- 2 stars
0.63%
- 1 star
1.14%
Showing 3 of 5330
JJ
Reviewed on Apr 28, 2017
As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.
GE
Reviewed on 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.
DT
Reviewed on May 26, 2020
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
Explore more from Computer Science
University of California San Diego
Stanford University
Stanford University
