Question

Write a java program to compare the performance of the quick sort, merge sort, iterative selection sort, iterative bubble sort, iterative insertion sort, and shell sort algorithms on a collection of random data. program is to generate a series of objects and place them in an arrayhen call each of the indicated sort routines to sort the original array on a user specified sort (key) field. here are the objects:

Answer 1

answer are very lanhy search on google