Question: Design and implement a program that will compare selection sort, insertion sort, shell sort, merge sort, and quick sort. See note below. You will need
Design and implement a program that will compare selection sort, insertion sort, shell sort, merge sort, and quick sort. See note below. You will need to meet the following specifications: Your program will read in words from an external file and store them in a simple object named scrabbleWord. The scrabbleWord class should implement the Comparable class. *scrabbleWord objects will be compared based on an integer score representing their Scrabble score. For reference see:
http://www.scrabblepages.com/scrabble/rules/ For simplicity, non-standard characters (e.g. '', '') will simply count 0. *scrabbleWord objects should be stored in a Java ArrayList. Proper Java Generics should be used. *Your project should implement a JUnit test for each sort method. Each sort method should sort the unsorted list, then call a single verification method to confirm the list is sorted. Your program will count swaps and compares for each run of each sort, and report these values to compare the swap algorithms.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
