To do so you'll need to write a private recursive sort method that accepts parameters identifying the start and start indices for the partition currently being sorted. The overriden sort() will call the private recursive one. Also, you may choose to use a separate private method to handle the partitioning of the array.
Once you have the quicksort working properly you can demonstrate it by having the .extensionFinder() method call display for the dictionary. The words should be ordered alphabetically based on the sorted words rather than on the original words.
We will be taking advantage of the sorted list in the next homework assignment.
Your program should be completely working and should follow all of the programming conventions named in class and explained in http://josephus.hsutx.edu/classes/all/javaconventions/ (including the use of comments that conform to the JavaDoc guidelines).
The instructor will grade your work based on what you have pushed to the hosted homework repository you have shared. For all assignments the program is due before the beginning of class on the due date. Repositories that show a commit time after that time will be graded as late.