Binary Search Mastery

National Curriculum Links

• Computer Science - Key Stage 3 (Year 8)
  • Understand and use computational abstractions that model the state and behaviour of real-world problems and physical systems.
  • Design, use and evaluate computational abstractions that model the state and behaviour of real-world problems and physical systems.
  • Understand how search algorithms work and how to implement them.

Learning Objectives

By the end of the lesson, students will be able to:

• Explain the concept and purpose of binary search in a sorted list.
• Demonstrate the binary search algorithm step-by-step on a sorted list.
• Implement binary search through guided and independent hands-on activities.
• Evaluate the efficiency of binary search compared to linear search.

---

Lesson Duration: 60 minutes

Class Size: 25 students

---

Lesson Structure Overview

Time	Segment	Description & Activities
0-10 mins	I Do	Clear explanation and demonstration of binary search
10-35 mins	We Do	Guided practice with the class using visual aids and whiteboard interactions
35-55 mins	You Do	Independent hands-on exercise solving binary search problems and mini assessment
55-60 mins	Plenary	Review and quick quiz to consolidate learning

---

Detailed Lesson Plan

0-10 mins: I Do – Teacher Explanation and Demonstration

Objective: Introduce binary search with a clear, visual explanation.

• Begin with a simple context: finding a word in a dictionary or a number in a phone book.
• Discuss the idea that binary search works only on sorted lists and is much faster than checking items one by one (linear search).
• Use a large printed or digital sorted list of numbers (e.g. 1 to 31) displayed visually via projector or interactive whiteboard.
• Model the binary search algorithm by thinking aloud:
  • Define low, high, and middle index.
  • Show how to check the middle item compared to the target.
  • Explain deciding if the search goes left or right based on comparison.
  • Repeat until the item is found or is concluded missing.
• Use a simple flowchart or stepwise slide that breaks down each decision in the algorithm for visual learners.

Differentiation:

• Provide printed step-by-step handout with visual aids for low ability learners.
• Extend explanation with actual pseudocode snippet for higher-ability learners.

---

10-35 mins: We Do – Guided Practice

Objective: Students collaboratively perform binary search with teacher support.

• Create small groups of 4-5 students, distribute printed sorted lists of 20 numbers and target numbers to find.
• On the whiteboard, work through a second example with the class, asking students to suggest next steps verbally and indicate low, high, mid values.
• Use a human number line activity in the classroom: place 20 students in a line holding number cards, and one student calls out a target number. Other students help by directing the search (e.g., “Check middle!” “Go left!”). This kinetic approach aids kinaesthetic learners.
• For students comfortable with coding, briefly demonstrate binary search in Scratch or block-based programming to show algorithm flow with conditional branches.

Formative Assessment:
Teacher asks questions throughout to assess understanding:

• Why must the list be sorted?
• What happens if the midpoint equals the target?
• How does the search range update?

---

35-55 mins: You Do – Independent Practice

Objective: Students apply binary search independently.

• Hand out worksheets with several sorted numeric lists and several target values to find using binary search. Each question requires:
  • Identifying low, high, mid index at each step.
  • Writing explanation sentences for their choices.
• For higher ability students:
  • Challenge them to compare how many steps their binary search took versus a linear search on the same list.
• For lower ability students:
  • Provide partially completed tables to fill in values or use number line diagrams for visual aid.
• Optionally, use classroom tablets/computers for an interactive binary search simulation or simple coding environment to perform the search.

---

55-60 mins: Plenary and Review Quiz

Objective: Consolidate learning and check for understanding.

• Quick-fire quiz using mini whiteboards or raise-of-hands:
  • True or false: Binary search always works on unsorted lists.
  • Which number would be the mid in a list of 15 items?
  • How does binary search decide to move left or right?
• Recap the benefits of binary search—speed, efficiency, requirement for sorted data.
• Set homework challenge: Find real-life examples where binary search or similar divide-and-conquer strategies can be applied.

---

Resources Needed

• Interactive whiteboard/projector
• Printable sorted number lists and worksheets
• Flowchart posters/handouts
• Set of number cards for human number line activity
• Tablets/computers (optional) with simple binary search programs (e.g. Scratch)
• Mini whiteboards and markers for quiz

---

Assessment and Feedback

• Formative assessment through questioning during guided practice.
• Summative assessment via worksheet completion and plenary quiz.
• Verbal feedback to individuals during “We do” activity and written feedback on worksheets.

---

Extension Ideas

• Introduce binary search trees in next lesson for interested groups.
• Challenge students to code binary search in Python or another high-level language.
• Explore variations like exponential search or interpolation search for top-tier learners.

---

This lesson plan utilises multiple learning styles, including visual (flowcharts, diagrams), auditory (discussion, explanation), and kinaesthetic (human number line), ensuring it is inclusive and engaging for all Year 8 learners while aligning with the national curriculum standards for Computer Science.