Divide and Conquer, Sorting and Searching, and Randomized Algorithms
$79
ENROLL NOWCourse Overview
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).
Course FAQs
What are the prerequisites for 'Divide and Conquer, Sorting and Searching, and Randomized Algorithms'?
Prerequisites for this continuing education class are set by Stanford University. Most professional development online classes benefit from some prior knowledge. Please check the provider's page for specific requirements.
Will I receive a certificate for this CE class?
Yes, upon successful completion, Stanford University typically offers a shareable certificate to showcase your new skills and fulfill your continuing education requirements.
How long does this online course take to complete?
Completion times for online continuing education courses vary. The provider's website will have the most accurate estimate of the time commitment needed.
