I am working on a project in a Java programming class that requires me to design a program to sort arrays of 10, 50, 100, 500, and 1000 integers using Quick Sort, Bubble Sort, and Insertion Sort. Each sort has its own class with a driver class to run the program. In addition, the arrays are each required to start as sorted, partially sorted and randomly sorted before the actual sorting algorithms are implemented.

Thank you for the opportunity to help you with your question!

There will be 3 classess for 3 sorting algorithms.

1. QuickSorter

2. BubbleSorter

3. InsertionSorter

And there will be super class which will be called by main program.

Sorter

The main program will always create instance of sorter using the Sorter class and pass a parameter. Depending on parameter the Sorter class will execute either one of the sorting techniques and print the output and time required for the sorting.

The code for all these classes will be large and will take at least 2 hours for me to finish.

If you need the codes as well please ask a general question to me instead of quick question of 20 minutes only.

Please let me know if you need any clarification. I'm always happy to answer your questions.