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
258,606 already enrolled
5,332 reviews
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

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

Offered by
Explore more from Algorithms

University of California San Diego

Stanford University

Stanford University

28DIGITAL
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.
Learner reviews
- 5 stars
82.74%
- 4 stars
13.59%
- 3 stars
1.87%
- 2 stars
0.63%
- 1 star
1.14%
Showing 3 of 5332
Reviewed on Jan 16, 2020
I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.
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 :-)
Reviewed on Jun 14, 2021
A Great course for someone who is a beginner and is really dedicated towards learning Algorithms! I loved the instructor's explanations for the proof of correctness of algorithms.




