Computing · Year 9

Active learning ideas

Searching Algorithms: Linear vs. Binary

Active learning works well for search algorithms because students grasp the speed difference only by physically counting steps and comparing results. When they see linear search struggle with large lists and binary search succeed, the contrast sticks better than abstract explanations ever could.

• National Curriculum Attainment Targets
• KS3: Computing - Algorithms
• KS3: Computing - Computational Thinking

• 20–45 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Stations Rotation
• 35 min · Small Groups

Card Sort Race: Linear vs Binary

Provide shuffled number cards (1-32) to groups. First, time linear searches for various targets. Sort the cards, then repeat with binary search, recording steps and times. Debrief on differences.

Compare the efficiency of a linear search versus a binary search on a sorted list of 1000 items.

Facilitation Tip

During the Card Sort Race, circulate with a timer visible so students notice how quickly binary search narrows the field compared to linear search.

What to look for

Provide students with a small, unsorted list of numbers (e.g., 10 items) and a target number. Ask them to count and record the exact number of comparisons needed to find the target using linear search. Then, provide a sorted version of the same list and ask them to count comparisons for binary search.

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Activity 02

• Stations Rotation
• 45 min · Pairs

Coding Benchmark: Algorithm Duel

Pairs pseudocode both searches, then implement in Python. Test on lists from 10 to 1000 items, logging comparison counts. Graph results to visualize efficiency curves.

Predict when a linear search might be more appropriate than a binary search.

Facilitation Tip

In the Coding Benchmark, ask students to print the midpoint value at each step to help them visualize binary search’s halving process.

What to look for

Pose the question: 'Imagine you have a list of 500,000 student IDs that are already sorted alphabetically. Which search algorithm, linear or binary, would you use to find a specific student ID, and why? What would happen if the list was not sorted?'

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Activity 03

• Stations Rotation
• 25 min · Small Groups

Scenario Debate: Pick the Search

Present real-world cases like finding a book in a library or contact in unsorted notes. Groups debate and justify linear or binary, then vote class-wide.

Analyze how the requirement for a sorted list impacts the choice of search algorithm.

Facilitation Tip

In the Scenario Debate, require students to reference their step counts from earlier activities when justifying their choices.

What to look for

On an index card, students write down one situation where a linear search would be the better choice than a binary search, and one situation where binary search is clearly superior. They must briefly explain their reasoning for each.

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Activity 04

• Stations Rotation
• 20 min · Individual

Prediction Sheets: Step Guesses

Individuals predict worst-case steps for linear and binary on lists of 16, 64, 512 items. Verify with teacher demo or apps, discuss surprises.

Compare the efficiency of a linear search versus a binary search on a sorted list of 1000 items.

Facilitation Tip

Use Prediction Sheets to let students revise their initial guesses after seeing the data, reinforcing that predictions improve with evidence.

What to look for

Provide students with a small, unsorted list of numbers (e.g., 10 items) and a target number. Ask them to count and record the exact number of comparisons needed to find the target using linear search. Then, provide a sorted version of the same list and ask them to count comparisons for binary search.

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

A few notes on teaching this unit

Teach search algorithms by starting with physical demonstrations before coding. Have students sort cards and time their own searches to build intuition about efficiency. Avoid rushing to abstractions—let students experience the frustration of linear search on large lists firsthand. Research shows that kinesthetic activities like sorting cards or flipping coins to simulate halving create stronger mental models than slides alone.

Students will confidently explain when to use each algorithm, predict performance on different-sized lists, and justify their choices with clear reasoning. By the end, they should recognize that binary search saves time only when the list is sorted and only for larger datasets.

---

Watch Out for These Misconceptions

• During Card Sort Race, watch for students assuming binary search works on any list without sorting first. Correct this by giving them an unsorted deck and asking them to halve it—when they can’t, have them sort the deck first and try again to see the difference.

  During Coding Benchmark, watch for students assuming binary search is always faster. Correct this by timing both algorithms on small lists (e.g., 10 items) and asking students to explain why linear search might be adequate in those cases.

• During Scenario Debate, watch for students claiming binary search is always superior regardless of data size. Correct this by having them refer back to their Prediction Sheets and step counts for smaller lists.

  During Prediction Sheets, watch for students dismissing linear search for tiny datasets. Correct this by asking them to time both algorithms on 5-item lists and discuss practicality versus raw speed.

• During whole-class demos scaling from 100 to 10,000 items, watch for students thinking efficiency only matters for enormous datasets. Correct this by asking them to estimate how long linear search would take on their phone’s contact list versus binary search on a sorted version.

  During Scenario Debate, watch for students overlooking the prerequisite of a sorted list for binary search. Correct this by having them sort a small list mid-debate and rerun their chosen algorithm to see the impact.

---

Methods used in this brief

• Stations Rotation