Linear and binary search lesson for Pearson Edexcel International A Level Computer Science, with editable PowerPoint slides, a student worksheet and full answers. A linear search checks items in order and a binary search halves a sorted list each step; students trace both and compare them.

Written for Unit 1 Principles of Computer Science, topic 5 Problem solving (specification 5.2.1, 5.2.2). Everything is editable, so you can adapt it to your class.

What’s included

• PowerPoint lesson (16 slides) with teacher notes on every slide
• Student worksheet (Word), ready to print or edit
• Answer sheet (Word) with mark-scheme style answers for every question

U1.33 Linear and binary search

By the end of the lesson students can:

• Hand-trace a linear search on an unsorted and a sorted list
• Hand-trace an iterative and a recursive binary search
• Compare the two searches and say when each can be used

Worksheet sections: A. Recall; B. Linear search traces; C. Binary search traces; D. Exam-style questions; E. Challenge

Every lesson includes

• Learning goals and a starter question
• Clear explanations, diagrams and worked examples (Python 3 throughout, as the specification requires)
• A quick check and a “your turn” task linked to the worksheet
• Exam-style questions with marks, and an exit ticket

Format

• PowerPoint (.pptx) and Word (.docx), fully editable
• Works in PowerPoint and Google Slides
• Calm, muted sixth-form design, consistent across the whole course

These are independent resources written for the Pearson Edexcel International Advanced Level Computer Science specification (Issue 1, first teaching 2026; IAS XCP01, IAL YCP01). They are not produced or endorsed by Pearson.

More lessons in this series

• Previous lesson: Recursion – Edexcel IAL Computer Science lesson
• Next lesson: Bubble sort and insertion sort – Edexcel IAL Computer Science
• Save with the bundle: Problem solving – Edexcel IAL Computer Science (8 lessons)

Last updated: November 2026.