Analysis bubble sort | Computer Science homework help

The analysis must contain:
? 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ÿ
o Graphs of your resultsÿ
o A comparison of the performance of the two versions of the algorithmÿ
o A comparison of the critical operation results and the actual execution time measurementsÿ
o A discussion of the significance of the standard deviation results and how it reflects the data sensitivity of your algorithm
o How your results compare to your Big-é analysisÿ
? A conclusion that summarizes the important observations of your studyÿ
Include any references, if they are used.
The attached file contains the java files from project 1 and the project 1 pdf.
ÿ
ÿ