A complete, no-prep, single-topic worksheet on sorting algorithms for GCSE Computer Science, mapped to AQA 8525 (3.1 Fundamentals of algorithms). Students trace a fully worked bubble sort, insertion sort and merge sort, then complete guided traces, independent practice and four exam-style questions with mark allocations — including the classic traps: one bubble sort pass only places the largest value, and a list is not sorted until a pass makes no swaps. Includes an extension page (counting bubble sort comparisons and choosing the right algorithm for the job) plus a full answer key with every trace worked, so marking takes minutes or students can self-mark. Print pages 2–3 for the class. 30–40 minutes, no equipment needed. Ideal for a cover lesson, homework, or targeted revision of algorithms.