CMSC 451 ATSU High Level Pseudocode for The Sorting Algorithm Programming Exercise
Question Description
Project 2 involves writing an analysis of the results that you obtained in first project. You are tosubmit a paper that discusses the results of your analysis. Your paper should include thefollowing items:? A brief introduction of the sorting algorithm that you have selected and how the twoversions of the algorithm compare including:o High-level pseudocode for the sorting algorithmso A Big-? analysis of the two versions of the algorithmo An explanation of your approach to avoiding the problems associated with JVMwarm-upo A discussion of the critical operation that you chose to count with an explanationof why you selected it? An analysis of the results of your study, which should include:o graph of critical operations for both algorithms and one for the execution timeso a comparison of the performance of the two versions of the algorithmo a comparison of the critical operation results and the actual execution timemeasurementso a discussion of the significance of the coefficient of variance results and how itreflects the data sensitivity of your algorithmo how your results compare to your Big-? analysis? A conclusion that summarizes the important observations of your studyIf for any reason, it was necessary to revise the program you submitted in project 1, the revisedsource code should also be included along with the paper.
"Place your order now for a similar assignment and have exceptional work written by our team of experts, guaranteeing you "A" results."