Assignment 3 - Due Date Oct. 27 - Grade Value 10 points

Required for Graduate Students - Optional for Undergraduate Students

The Assignment is to complete Doing Work in a Tree , where the Work is sorting a random permutation of the integers 0 to 63
Your code should actually work for any list of 64 integers. The use of a permutation in the work you turn in is just for debugging purposes. :
  1. At the top level of the tree the work is a bubble sort of 16 integers.
     
  2. At the lower levels there are shuffle sorts of two lists of 16 then 32 sorted lists of integers.
     
  3. It should run with a version of the given SLURM script.

 
The assignment can be submitted to me as either an email with source code attached or instructions telling me how to find your source code in your cluster directory. I will need appropriate permissions in this second case.

Exam Question 9 Comment

Bubble Sort Notes

A Run in My Version

A Solution

 tree_sorter.c      tree_sorter.h