Two free sample worksheets on sorting algorithms for AQA A Level Computer
Science (7517), with full answer keys, so you can see exactly what the full
pack contains before buying anything.

Each sheet sorts the same eight values twice. The bubble sort is traced pass
by pass, with the number of swaps in each; the merge sort is a diagram to
complete, already split down to single values, with three rows of merging left
blank. Question 3 asks for the time complexity of both and for the number of
merge levels a much larger list would need.

The bubble sort is printed in pseudocode on the worksheet, so the rule that
stops it is in front of the student rather than in the teacher’s head, and the
lists are eight values long, so every merge sort split is even.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, every one built on a
different list. Search ����Vlog for “AQA A Level Computer Science sorting
algorithms” to find it.

If these are useful, a review is genuinely appreciated - it is the only way
other teachers find resources like this.