Coursera 上普林斯顿大学的算法公开课，开个仓库小记一下。
课程资源：1. Algorithms, Part I 2. Algorithms, Part II 3. Algorithms, 4th Edition。
| Week | Lecture1 | Lecture2 | Programming Assignments |
|---|---|---|---|
| 1 | Union Find | Analysis of Algorithms | PA1: Percolation |
| 2 | Stacks And Queues | Elementary Sorts | PA2: Deques and Randomized Queues |
| 3 | Mergesort | Quicksort | PA3: Pattern Recognition |
| 4 | Priority Queue | Symbol Tables | PA4: 8 Puzzle |
| 5 | Balanced Search Trees | Geometric Search | PA5: KdTrees |
| 6 | Hash Tables | Symbol Table Applications |
| Week | Lecture1 | Lecture2 | Programming Assignments |
|---|---|---|---|
| 1 | Undirected Graphs | Directed Graphs | PA1: WordNet |
| 2 | Minimum Spanning Trees | Shortest Paths | PA2: Seam Carving |
| 3 | Maximum Flow and Minimum Cut | Radix Sort | PA3: Baseball Elimination |
| 4 | Tries | Substring Search | PA4: Boggle |
| 5 | Regular Expressions | Data Compression | PA5: Burrows–Wheeler Data Compression |
| 6 |