Divide and Conquer, Sorting and Searching, and Randomized Algorithms
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer...
By Stanford University on Coursera
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).
Topics Covered
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.
Similar Courses
HTML & CSS Coding for Beginners: Build your own portfolio!
Chris Dixon
Maya for Beginners: Animation
Lucas Ridley
JavaScript for Beginners (includes 6+ real life projects)
Kalob Taulien
Beginner Bootstrap 4: Hand code beautiful responsive websites fast
Chris Dixon