[COMPUTER SCIENCE HELP (2/3)] - Java

Task 2:

Create a class named Sort that will act as a container for the following generic array sorting algorithms:

simpleBubbleSort

a brute force bubble sort that just uses a pair of nested loops

this needs to be a generic bubble sort

this needs to be a stable sort

insertionSort

the insertion sort as discussed in class

you may use the code from the Java Illuminated text modified to be generic

make sure it is a stable sort

selectionSort

the insertion sort as discussed in class

you may use the code from the Java Illuminated text modified to be generic

make sure it is a stable sort

mergeSort

this should be the recursive mergeSort described in the textbook

quickSort

this should be the recursive quickSort described in the textbook

you may have to modify this code

radixSort

this should be a generic sort

the radixSort should be able to support between two and four keys

the first parameter in the parameter list should be the array being sorted.

the remaining parameters in the parameter list should be the keys, ordered left to right from most significant to least significant

you should use the Radix sort described in class and not the bucket approach described in the textbook