[SOLVED] CMSC451 PROJECT 2 SORTING ALGORITHMS ANALYTICS

[SOLVED] CMSC451 PROJECT 2 SORTING ALGORITHMS ANALYTICS: Project 2 involves an analysis of the results that you obtained in first project. You are to submit a
paper, written with Microsoft Word, that discusses the results of your analysis. Grading of the
second part will be based on the following items:

• A brief introduction of the sorting algorithm that you have selected and how the two
  versions of the algorithm compare
• A discussion of the critical operation that you chose to count with an explanation of why
  you selected it
• A Big-Θ analysis of the two versions of the algorithm
• A discussion of the results of your study, which should include
  • graphs of your results
  • a comparison of the performance of the two versions of the algorithm
  • a comparison of the critical operation results and the actual execution time
    measurements
  • a discussion of the significance of the standard deviation results and how it reflects the data sensitivity of your algorithm
  • how your results compare to your Big-Θ analysis
• A conclusion that summarizes the important observations of your study

If for any reason, it was necessary to revise the program you submitted in project 1, the revised
source code should also be included along with the paper.

You May Also Like

[SOLVED] CMSC451 PROJECT 1 BENCHMARKING SORTING ALGORITHMS

$32.55

[SOLVED] CMSC451 PROJECT 1 BENCHMARKING SORTING ALGORITHMS: The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort, quick sort or heap sort. You must post your selection in the “Ask the Professor” conference. No more than five students may select any one algorithm.

By: GradeMeritsadmin