10 pts Upload your project folder, named LastnameP4 (such as NelsonP4) to Brightspace. Delete the X64/debug and ipch folders and Browse.VC file before zipping the project to upload.

The output files from the three sorts should be in your project.

The P4 Timing Runs Assignment will consist of running 3 data files on your computer and producing timing results for all of the sorts. The assignment provides a set of the three files that all of you will run. Obtain the files BJTest50K.txt, BJTest100K.txt, BJTest200K.txt from Brightspace. They will act like a control group for timing.

You need to have your project stored locally (not across a network or on a jump drive!!) on your computer i.e. on the Desktop and execute it there without any other programs running. We are aiming for everyone’s code to execute with the same type processor dedicated only to the sorting task. Or as close as we can. 😊Use Release mode.

You’ll run your program three times and be sorting three data files, one with 50,000 numbers, one with 100,000 and one with 200,000 numbers.

It is important that you allocate the array memory dynamically for your arrays that are to be sorted. See the sample code at the end of the assignment. Use const statements for the SIZE and Filename for your convenience.

Have your timing runs completed and uploaded by the beginning if class on the due date. I will assign a portion to each of you in class to graph using Excel so we can compare sorts.

Also, on your Sort.h, for each sort, you need to tell me the letter of the sort routine presented in class.