- Stanford University
- 4 weeks
- 4-8 hours/week
- Paid Certificate Available
- Part of:
- Algorithms | Coursera
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.
Introduction; "big-oh" notation and asymptotic analysis.
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
The QuickSort algorithm and its analysis; probability review.
Linear-time selection; graphs, cuts, and the contraction algorithm.
- Go to Course: