janluke/algorithms_princeton_template

Coursera Programming Assignments template for the Princeton's Algorithms course

Algorithms.

Solutions of the Algorithms courses of the Princeton University in Coursera.

Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.

The details of the courses can fe found in:

• Algorithms, Part I
• Algorithms, Part II

Structure

The src folder contains the solutions for each week in the following structure:

• Algorithms, Part I
  • edu.princeton.cs.algorithms.percolation: Solutions for the Week 1. The programming assignment specification could be found here: Percolation.
  • edu.princeton.cs.algorithms.queues: Solutions for the Week 2. The programming assignment specification could be found here: Deques and Randomized Queues.
  • edu.princeton.cs.algorithms.collinearpoints: Solutions for the Week 3. The programming assignment specification could be found here: Collinear Points.
  • edu.princeton.cs.algorithms.sliderpuzzle: Solutions for the Week 4. The programming assignment specification could be found here: 8 Puzzle.
  • edu.princeton.cs.algorithms.kdtrees: Solutions for the Week 5. The programming assignment specification could be found here: Kd-Trees.

Note

The Gradle project creates for each assignment a task that will remove for each file, the package information and will put then in a zip file ready to submit to the Coursera platform. Before creating the Zip file, it will run the tests, SpotBugs, PDM, and CheckStyle to verify the quality of the solution.