Linear and binary search: Search a list one item at a time, or halve it each time. A complete, ready-to-teach 90-minute lesson for OCR GCSE (9–1) Computer Science J277, spec 2.1.3, Paper 2 (J277/02). Download it and teach it, no preparation needed.

WHAT’S INCLUDED
• PowerPoint (90 slides) with step-by-step animated worked examples and click-to-reveal answers
• Worksheet with three levels: Bronze (grades 2–4), Silver (4–6) and Gold (6–9)
• Exit tickets with a confidence scale
• Teacher answers with full working

LESSON FLOW
• Recall (6 questions) and starter (4 questions), timed
• Objectives, key words and a key facts slide
• Part A: Linear search · Part B: Binary search · Part C: Compare and recognise
• Each part: method, I do, We do, You do (6 mini-whiteboard questions; the score picks the worksheet level), timed worksheet task, answers
• 4 original exam-style questions (10 marks) with a mark-by-mark walkthrough
• Exit ticket

LEARNING OBJECTIVES
• To know: The steps of a linear search and a binary search, and that binary search needs sorted data
• To understand: Why binary search needs far fewer comparisons than linear search on a big sorted list
• To be able to: Show each step of both searches on data, count comparisons and recognise them from code

WHY TEACHERS LIKE IT
• Visual first: every worked example builds one click at a time
• Teacher notes on every slide: timings, what to say, and the mistakes examiners report
• Every answer checked: calculations, traces and code are worked out by running them
• Exam-style questions written to match J277 command words and mark tariffs

Key words: Linear Search, Binary Search, Sorted, Comparison.
Part of Unit 7: Algorithms. Also available in the Unit 7 bundle and the full course bundle.

Original resource by Mo² (Mo Squared Resources). Not endorsed by OCR.