OCR J277 Computer Science 2.1 Sorting Algorithms

OCR J277 GCSE Computer Science 2.1.3 lesson: bubble, merge and insertion sort with every step shown, trace tasks and exam questions. 28 slides.

A complete, ready-to-teach lesson for OCR GCSE Computer Science (J277) 2.1.3, covering all three sorting algorithms in the specification.

What’s included (28 editable slides)

• Learning objectives and a Do Now with answers
• Merge sort: the steps, animated dividing and merging, and a “Your Turn” task with a drawn answer
• Bubble sort: the steps, a diagram of every comparison in every pass, and a “Your Turn” task with answers
• Bubble sort in OCR Exam Reference Language, with a trace task and full trace table answer
• Efficiency task comparing two versions of bubble sort, with answers
• Insertion sort: the steps, a colour-coded worked example, and a “Your Turn” task with answers
• “Recognise the Code”: insertion sort in Exam Reference Language, with clues for identifying it in the exam
• Three-way comparison table of all three algorithms
• Exam-style questions, including insertion sort, with a mark scheme

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

This is lesson 6 of 6 in the OCR J277 2.1 Algorithms unit, also available as a complete bundle with booklets, homework and assessments.