In this project, we are going to explore the specifics of searching and sorting. You will each be working through an xSortLab experiment in order to explore, evaluate and explain a particular sorting algorithm.

Select Merge Sort

Write an experiment report detailing your predictions, calculations, findings, and tests.

Read about your assigned algorithm (Merge Sort);

View the visual presentation of your algorithm in xSortLab;

Describe the process the algorithm is executing;

Characterize and evaluate the algorithm in terms of complexity;

Observe the speed and efficiency of the algorithm;

View timed mode for 10 arrays of various sizes: 10^3, 5 x 10^3, 10^4, 5 x 10^4. If your algorithm is not too slow, you can also try 10^5 and 10^6.

Warning: Start low in case your algorithm is slow.

Note: one person on the team should run the various timing cases to eliminate differences due to computer systems. The applet provides an information summary in the "log" option in its top menu. For timing, record the Compute time. Also record the information needed for the next bullet item below.

Keep a record of the number of elements in each array, along with the number of compares, the number of copies and the amount of time required to complete the sort;

Use Maple to create a plot that illustrates whether or not there is a possible correlation between data size and time;

Use Maple to create a plot that illustrates any possible correlation between the number of compares and time;

Use Maple to create a plot that illustrates any possible correlation between the number of copies and time;