Code-along with Stanford's Algorithms: Design and Analysis, Part 1 on Coursera
- Introduction
- Asymptotic Analysis
- Divide and Conquer Algorithms
- The Master Method
- Quicksort
- Probability Review
- Probability Review
- Linear-time Selection
- Graphs and the Contraction Algorithm
- Graph Search and Connectivity
- Dijkstra's Shortest-Path Algorithm
- Heaps
- Balanced Binary Search Trees
- Hashing: The Basics
- Universal Hashing
- Bloom Filters