videos
Slides
- pre lecture 0 slides
- lecture 0 slides
- pre lecture 1 slides
- lecture 1 slides
- pre lecture 2 slides
- lecture 2 slides
Demos
topological sort
shortest path in a DAG
Longest common subsequences
Longest increasing subsequence
Edit distance
- edit-dist.py
Reading
- Dynamic programming :: CLRS 14
- Topological Sort :: CLRS 20.4
- Shortest path in DAG :: CLRS 22.2