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
Get one of our best deals and build skills with 50% off Coursera Plus. Save now.

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

Instructor: Tim Roughgarden
258,720 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
Status: Free TrialUniversity of California San Diego
Status: Free TrialStanford University
Status: Free TrialStanford 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 Mar 26, 2020
I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!
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 May 27, 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




