Princeton Algorithms - Assignment Solutions

Solutions to the programming assignments from the Coursera MOOC: Algorithms, Part I and Part II by Kevin Wayne, Robert Sedgewick.

Each assignment is solved in chronological order has is organized into its own Netbeans project. Each project may have multiple run configurations, which you can access via run > Set Project Configuration.

If you intend to use Netbeans as well, I recommend installing the checkstyle and findbugs plugin. They are used in evaluating your assignments.

Part I

1. Percolation (Union-find) - Score: 86%
2. Randomized Queues and Deques (Queue and Stack) - Score: 99%
3. Pattern Recognition (Sort) - Score: 94%

• Solution contains subsegment of a segment in reference solution. I did solved that, but used HashMap which got disqualified (cannot use hashcode()); for that reason that code block is commented out.

4. 8 Puzzle (Priority Queues) - 90%
5. Kd-Tree (Balanced Search Trees) - 86%

Part II

6. WordNet - not completed
7. Seam Carving - not completed
8. Baseball Elimination (Network Flow) - not completed
9. Burrows-Wheeler Data Compression Algorithm - not completed