These are the programming assignments from Coursera's Algorithms course (Part I and Part II) taught by Robert Sedgewick and Kevin Wayne provided by University of Princeton.
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.
- Percolation [100/100]
- Deques and Randomized Queues [100/100]
- Collinear Points [100/100]
- 8 Puzzle [100/100]
- Kd-Trees [100/100]
- WordNet [100/100]
- Seam Carving [100/100]
- Baseball Elimination[100/100]
- Boggle [100/100]
- Burrows–Wheeler [100/100]