Tracing a Merge Sort algorithm (AQA A Level Computer Science)
Channel: Mr Dimmick's Computing Channel
Date: 2017-04-01

In this video you will learn about the Merge Sort sorting algorithm. You will see a visual short overview of the divide-and-conquer method, before an explanation of a pseudocode representation of a recursive Merge Sort algorithm. Finally, you will watch a walk-through of an exam question that requires you to complete a trace table for the same recursive algorithm.

This is a long video, however it is hoped that you will find parts, if not all, of it helpful in developing your understanding of this algorithm.

Exam question material (including the algorithm) copyright AQA. Original exam question available here: http://filestore.aqa.org.uk/resources/computing/AQA-75171-SQP-ADD.PDF

You can access a growing resource of sample algorithms written in Python to accompany the AQA A Level Computer Science course here: https://github.com/ShiplakeCS/A-Level-AQA-CS