Create a package named lab10 (no spaces, ALL in lowercase) where you will place your lab files. Create a class SortingAlgorithms with the following methods:
mergeSort that will implement the algorithm learned in class (see slides for code and copy it from there)
selectionSort that will implement the algorithm learned in class (see slides for code and copy it from there ).
two fields:
mergeCtr that will count the merge sort steps
selectionCtr that will count the selection sort steps
these fields must be placed strategically to count every iteration of the sorting algorithms.
two more methods:
getMergeCtr that will return the value of mergeCtr
getSelectionCtr that will return the value of selectionCtr
An app SortingApp that will:
Create an array a with the values 22, 18, 12, -4, 58, sort it using mergeSort, and display the number of steps it took to sort it.
Create another array b with the same values as a 22, 18, 12, -4, 58 and sort it using selectionSort and display the number of steps it took to sort it.
Create another array c with the values 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 sort it using mergeSort, and display the number of steps it took to sort it.
Create another array d with the same values as c 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 and sort it using selectionSort and display the number of steps it took to sort it.
Compare the results among the different calls to the sorting methods, the steps it took to sort, and display a message with your conclusions.