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

Part 1, 0 points: Create FriendsFinder.java, and add a static method, nearestFriends, that takes a List of Point objects (the stats of all friend's fandoms) and returns a List that contains exactly two of those Points (the two closest friends).

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 friend lists where you can correctly find the closest friends in a restricted amount of time. Here is FriendsFinderTester.java, which will run your code on increasingly larger lists of points. It does not test the correctness of larger lists of friends, due to run 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: I highly recommend that you start with the brute-force method to solve this. That will get you some of the points on this project and will help you understand how to write the code and use the java.awt.Point class, while the algorithm itself is quite easy to implement.

Part 6, 0 points: A divide-and-conquer algorithm exists for this project, but it is not straightforward, as you might imagine. I expect that I will cover this algorithm in class. If you are having trouble implementing the divide-and-conquer version, please come ask me questions!

Part 7, 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: