Objective:

The objective of this assignment is to practice and implement recursive versions of different sorting

algorithms.

Problem Specification:

Please download the SortingGenericSample before start. Write generic recursive Java programs which reads the elements from the following array and then sorts them using a selectionSort,

bubbleSort, and insertionSort algorithms.

Sample Input: Janet, Bob, Tom, Alan, Ellen, Karen, Wendy

Sample Output $($Using selection sort algorithm$)$: Alan, Bob, Ellen, Janet, Karen, Tom,

Wendy

Sample Output $($Using bubble sort algorithm$)$: Alan, Bob, Ellen, Janet, Karen, Tom,

Wendy

Sample Output $($Using insertion sort algorithm$)$: Alan, Bob, Ellen, Janet, Karen, Tom,

Wendy

After you have coded your generic recursive sorting algorithms, you need to test and see how

long your sorting algorithms takes to run for input size $10,100,1,000,$ and $10,000.$ Your program

should create integers and print a table like this: You can get a random list using the java class

ArraySize Selection Sort Bubble Sort Insertion Sort

$10$

$100$

$1,000$

$10,000$

Random, located in java.util.Random. To test the speed of your sorting algorithms, you should use

the System.currentTimeMillis$()$ method, which returns a long that contains the current time $($in

milliseconds$).$ Call System.currentTimeMillis$()$ before and after the algorithm runs, and subtract

COSC$2007$: Assignment$-2$

the two times