Project 2 involves writing an analysis of the results that you obtained in first project. You are to submit a paper that discusses the results of your analysis. Your paper should include the following items:
A brief introduction of the sorting algorithm that you have selected and how the two versions of the algorithm compare including:
o High-level pseudocode for the sorting algorithms
o A Big-Θ analysis of the two versions of the algorithm
o An explanation of your approach to avoiding the problems associated with JVM warm-up
o A discussion of the critical operation that you chose to count with an explanation
of why you selected it
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |