Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Offered By: Stanford University via Coursera
Course Description
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).
Syllabus
- Week 1
- Introduction; "big-oh" notation and asymptotic analysis.
- Week 2
- Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
- Week 3
- The QuickSort algorithm and its analysis; probability review.
- Week 4
- Linear-time selection; graphs, cuts, and the contraction algorithm.
Taught by
Tim Roughgarden
Tags
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Algorithms: Design and Analysis, Part 2
Stanford University via Coursera