Technology: Java, Eclipse

For this project, I implemented algorithms such as insertion sort, merge sort,
quick sort, and selection sort to sort points from lowest to highest. The user had
a choice of the points being in a cartesian graph format or a polar angle graph format.
I also used an abstract class called AbstractSorter that's used by the sorting
classes to adapt to the chosen sorting method and format (cartesian vs polar).

InsertionSorterTest.java (click on image to download file):

Output of the above test case, the test cases for the rest of the algorithms are the same:

Point.java (click on image to download file):

PolarAngleComparator.java (click on image to download file):

AbstractSorter.java (click on image to download file):

CompareSorters.java (click on image to download file):

InsertionSorter.java (click on image to download file):

MergeSorter.java (click on image to download file):

QuickSorter.java (click on image to download file):

SelectionSorter.java (click on image to download file):