Learning Goal: I’m working on a java multi-part question and need the explanation and answer to help me learn.
See the document attached for complete details.
Overview: This project is to implement two sorting algorithms. The first sorting algorithm is an (2)algorithm: either Selection Sort or Insertion Sort or Bubble Sort. The second algorithm is Quicksort.Your Quicksort algorithm must use at least two practical improvements that were discussed inclass. With all of this done, you will be asked to gather some data about the running time and plot it.
Requirements: You must implement the two sorting algorithms above. They should sort the numbers in ascendingorder (smallest to largest). When you submit your project, you must have functioning code for bothsorting algorithms, but you can comment out the lines in your main method which actually do thesorting (so I can uncomment a single line to switch the sorting algorithm). If youd like, you can askthe user which sorting algorithm and do it that way.
You must also have a method/function confirmSorted(). This function should take your array ofnumbers, verify that it is sorted in ascending order, and return a Boolean. If the numbers areconfirmed to be sorted, print out Confirmed sorted and if they arent sorted, print out ConfirmedNOT sorted. Do this before and after the sort.
Data analysis: In addition to your code, youll be asked to try out each sorting algorithm will datasets of differentsizes and record the running time (in milliseconds). With this data, you should create a table andgraph like the one below. In a paragraph or two, please write what youve discovered with this data,explain what is happening with the data and whyYou will be provided with datasets of the following sizes: 10, 100, 1000, 5000, 10000, 25000, 50000,75000, 100000, 250000, 500000, 750000, 1000000, and 10000000. Please include results for allthese datasets in your analysis. Some combinations of algorithm and dataset size wont be feasibleand may be excluded (the slower algorithm will start to take a VERY long time with large datasets).
Extra credit:Implement the classic Merge Sort algorithm and compare the usage of the memory between Merge Sortand Quick Sort (or one of the basic sorting algorithms)
