- Platform
- Coursera
- Provider
- Stanford University
- Effort
- 4-8 hours/week
- Length
- 4 weeks
- Language
- English
- Credentials
- Paid Certificate Available
- Part of
- Course Link
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).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Taught by
Tim Roughgarden
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).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
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.
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