AQA GCSE Computer Science 3.1 Sorting Algorithms Lesson

AQA GCSE Computer Science 3.1 lesson: bubble sort and merge sort with every step shown, trace tasks, exam questions and answers. 23 editable slides.

A complete, ready-to-teach lesson for AQA GCSE Computer Science (8525) 3.1.4 Sorting algorithms, including the comparison of efficiency from 3.1.2.

What’s included (23 editable slides)

• Learning objectives and a Do Now with answers
• Merge sort: the steps, plus animated dividing and merging stages
• “Your Turn” merge sort task with a full drawn answer
• Bubble sort: the steps, plus a diagram showing every comparison in every pass
• “Your Turn” bubble sort task with answers and an extension question
• Fill-in-the-blanks consolidation with answers
• Bubble sort pseudocode with a trace task and full trace table answer
• Efficiency task comparing two versions of bubble sort, with answers
• Merge sort vs bubble sort comparison table
• Exam-style questions with a mark scheme

Teacher notes on every slide, including misconceptions, teaching suggestions and practical demonstrations.

This is lesson 5 of 5 in the AQA 3.1 Algorithms unit, which is also available as a complete bundle with booklets, homework and assessments.