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

Part 1, 0 points: Create a new file, SongSelector.java, in which you will add a static method, chooseSongs, that takes an List of integers (the lengths of the songs) and returns an List of integers that contains the indices of the songs you pick to include in the playlist. You are welcome to include any other methods/classes you want, so long as they are all called by this method.

Part 2, 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 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 song lists that you can correctly find the longest sublist for in a restricted amount of time. Here is my SongSelectorTester.java, which will run your code on increasingly larger lists of song lengths. It does not check the validity of larger trials due to time constraints. (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: You can start with the brute-force algorithm here, in order to earn some points and make sure you know how everything works.

Part 6, 0 points: In order to score all of the points, I think you will need to use dynamic programming. Here's a hint for your scheme: any time you choose to include a song, you have to skip the songs before and after it. Sometimes you won't want to skip just one song, but two. However, you will never want to skip three songs, as you could increase the length by including that song in the middle of those three. If you can't come up with the scheme, please come and talk to me so I can help you.

Part 7, 0 points: I did not get a speedup from using multiple processors for this project, but you are welcome to try using them.

Submitting your Project:

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