Java

Sorting and array can be thought as a recursive problem where the base case is reached when the array to be sorted has very small length, usually 1. As noted in class, some algorithms are better described using a recursive definition (like Merge Sort) and others are easily written using an iterative approach (like Bubble Sort). Nonetheless, every recursive algorithm can be translated into an iterative algorithm and vice versa. Write recursive versions of the following sorting algorithms: Bubble Sort. Selection Sort. Insertion Sort. and write iterative versions of: Quick Sort. Merge Sort (EXTRA CREDIT, HONORS). In order to test your algorithms generate files containing a random collection of integers each with the following order: 100, 200, 400, 800, 1600 and 3200 integers respectively For each algorithm include a counter auxiliary variable to keep track of the total number of comparisons made to sort the corresponding arrays. Finally, use a graphical utility to plot the number of comparison vs. the size of the array for each algorithm. Create for each algorithm five appropriate test files with different orders of magnitude to consider the worst, and best case scenario for each algorithm