There are a number of options to sort a group of items. Some of the options: Phase 1: Execution time for Sorting Write

[answerhappygod]

There are a number of options to sort a group of items.
Some of the options:
Phase 1: Execution time for Sorting
Write a program that obtains the execution time of selection
sort, bubble sort, merge sort, quick sort, heap sort, and radix
sort for input size 50,000, 100,000, 150,000, 200,000, 250,000, and
300,000.
Create a method or class for each sorting algorithm and call
them from the main().
Your program should create data randomly and print a table like
this:
Array size
100,000
200,000
300,000
Insertion Sort
Bubble Sort
Merge Sort
Quick Sort
Heap Sort
Radix Sort
(HINT: You can use the following code template to obtain
the execution time.)