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

Part 1, 0 points: Create a MySorter.java file and add a void static method, sort, that takes an array of integers and sorts it.

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 arrays you can correctly sort in a restricted amount of time. Here is MySorterTester.java that will run your code on growing arrays. 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: I strongly recommend starting with easy-to-code sorting algorithms, then adding faster sorts as you go.

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: