Divide and Conquer, Sorting and Searching, and Randomized Algorithms
By Coursera
on Coursera
· Technology
About This Course
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).
Instructor
Divide and Conquer
Frequently Asked Questions
How much does Divide and Conquer, Sorting and Searching, and Randomized Algorithms cost?
Divide and Conquer, Sorting and Searching, and Randomized Algorithms costs $79. Check the course page for current pricing and available discounts.
Who teaches Divide and Conquer, Sorting and Searching, and Randomized Algorithms?
Divide and Conquer, Sorting and Searching, and Randomized Algorithms is taught by Stanford University, Stanford University.
What skill level is Divide and Conquer, Sorting and Searching, and Randomized Algorithms for?
This course is designed for advanced learners.