The following is a checklist which provides a summary of the assignment. This is meant only as a supplement; please read the original assignment description.

[Michael 12:15am, 2/18] This checklist originally had a typo, when it listed values of N for which you should test part C of the assignment. (it originally listed 8193 as a value when it should have said 8192. This typo has been changed)

[Michael 1:47pm, 2/16] Want to see one example of a blocksort in action? click here.

You are asked to accomplish three different tasks:
TaskA: use random floats and count comparisons used
TaskB: print out sequence of exchanges and parallel stages
TaskC: implement a block sort

Each task is to be acomplished purely by modifying Sort.c. You are not allowed to modify either batcher.c or batcher.h. Please do not submit batcher.c or batcher.h -- we will use the originals.

For each of the three tasks, you are to submit a separate version of Sort.c, modified accordingly. Of course, to submit these, you must give each version a different name (may we suggest SortA.c, SortB.c and SortC.c for the three different tasks?). For this week's readme file, please provide a single file, which includes a separate section for each of the three tasks, containing any required information.

Below we summarize exactly what is required for each task. This week, the checklist will not contain a "progress steps" list, as the steps for progress are clearly written in the original assignment.