Example of the 1st step in a merge sort- cut the data set into sublists, each 1 item long. This is for a AQA computing project. part 2 is unreleased
