Report

Introduction - provide a short introduction of what this report is about.

Methodology - describe how the results were generated, i.e., how many runs did you do, and with what list sizes. Try to be very systematic and thorough (why not? - this step should be pretty easy, as you already have the code to support your study).

a graph of input size (x-axis) vs. time (y-axis), properly formatted labeled (for this, you may use Excel, Google Drive, etc.). The graph should contain different curves, one per sorting algorithm. For example, see Fig. 2.4 in textbook.

a second graph (magnification of the first) which demonstrates the threshold list sizes for quicksort, and possibly mergesort. For example, see Fig. 2.3 in textbook.

the graphs should be surrounded by explanatory text describing how they were generated and what they show, and have meaningful captions. Again, for example, see explanatory text provided in textbook for Figs. 2.2, 2.3, and 2.4.

Discussion - provide a summary of what was tried and what was learned. In particular, if you find that mergesort also benefits from a threshold list size, this is the place to (profusely) mention it. This is your BIG finding (to the best of your knowledge).

References - provide any references used (e.g., textbook, etc.)

Submissions

Submit via OAKS as follows:

Create a folder named 'First.Last', where 'First' is your first name, and 'Last' is your last name.