My notes, implementations, solutions for assignments and quizzes for Princeton Algorithms course part I and Princeton Algorithms course part II, by Princeton University. This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. I haven't finished part II.
Princeton Algorithms course part I
| Week | Spec |
|---|---|
| 1 | Percolation |
| 2 | Queues |
| 3 | Collinear |
| 4 | 8 Puzzle |
| 5 | Kd-Trees |
Princeton Algorithms course part II
| Week | Spec |
|---|---|
| 1 | WordNet |
| 2 | Seam Carving |
| 3 | Baseball Elimination |
| 4 | Boggle |
| 5 | Burrows–Wheeler |