Part 0, 0 points: Look at the instructions below to organize your code to simplify the submission process.

Part 1, 0 points: Add a JavaDoc comment header to describe your project and list who is in your team. Additionally, add a method to your class, getAuthors, that returns a string with the names of all members of your team, like this:

    /**
     * Returns the authors' names.
     * @return  The names of the authors of this file.
     */
    public static String getAuthors() {
        return "Anne Borgin and Kyle Burke";
    }

Part 2, 0 points: Create a SaddlebagBalancer.java file, you will add a static method, getPartition, that takes a List of Integers (the full list of weights of packages) and returns a List of integers of the same length where all elements are either 0 or 1.

    public static List<Integer> getPartition(List<Integer> packageWeights) {

Part 3, 0 points:

You'll need these files in order to run the tester:

• SpeedGrader.java
• BenchmarkJava.java

Part 4, 100 points: Your grade will be based on the longest lists you can successfully partition in a restricted amount of time. Here is SaddlebagBalancerTester.java, which will test your code on increasingly larger lists. It may not be able to test the validity of your code; you may want to add that in yourself. (If you submit it to me, I will be able to check the validity.) Important notes:

• If any of the tests produce the wrong answer, you won't get any points.
• Testing runs you try yourself do not give an official grade; you'll need to submit and have me run them for that.
• When testing on your own, you'll need to enable assertions. In the command line, you can do that with the -ea flag: java -ea ClassToExecute If you're using an IDE, you'll have to look online to figure out how to enable them.

Part 5, 0 points: In order to solve this problem you (essentially) need to test every possible division of elements into the two sublists. That is an exponential number of possible divisions. The tricky part of this is to go through all possibilities in a (relatively) efficient way, and then test them to find one that works.

Part 6, 0 points: I expect that you'll need to use multiple threads to earn maximum points in the project. Hint: the computer I'm grading on has 16 CPUS.

Submitting your Project:

The files I'm looking for in this project are:

• SaddlebagBalancer.java