Computer Science · 10th Grade

Active learning ideas

Linear and Binary Search Algorithms

Active learning works well for linear and binary search because students physically experience the difference between brute-force and divide-and-conquer strategies. When they act out the steps themselves, the abstract concept of algorithmic efficiency becomes tangible and memorable through movement and discussion.

• Common Core State Standards
• CSTA: 3A-AP-15

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

Activity 01

• Role Play
• 20 min · Whole Class

Role Play: Find the Number

Give each student in a row a card with a number , first unsorted, then sorted. One volunteer must find a target using linear scan (check left to right) in the first round, and binary search (go to middle, ask 'higher or lower?') in the second. The class counts steps for both. Works best with 15-20 students.

Differentiate between linear and binary search in terms of efficiency.

Facilitation Tip

During Role Play: Find the Number, assign roles clearly and have students practice the exact comparison language used in code to reinforce precision in algorithm steps.

What to look for

Present students with a sorted list of 16 numbers and a target value. Ask them to trace the steps of a binary search, writing down each midpoint and comparison. Then, ask them to do the same for a linear search and compare the number of steps.

• Apply
• Analyze
• Evaluate
• Social Awareness
• Self-Awareness

Activity 02

• Think-Pair-Share
• 20 min · Pairs

Think-Pair-Share: When Does Binary Search Break?

Students are given three scenarios: searching an unsorted phone book, searching sorted test scores, and searching a database that updates frequently. Pairs discuss whether binary search works for each and why, then share their conclusions with the class. Surfaces the pre-condition that binary search requires sorted data.

Analyze the conditions under which binary search is more advantageous.

Facilitation Tip

For Think-Pair-Share: When Does Binary Search Break?, provide a partially sorted list so students see how binary search fails when data isn’t fully ordered, making the correction immediate and concrete.

What to look for

Pose the question: 'Imagine you have a phone book with 10,000 names. Would you use linear search or binary search to find a specific name? Explain your reasoning, considering the time it would take for each method.'

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Activity 03

• Inquiry Circle
• 35 min · Pairs

Inquiry Circle: Step Count Spreadsheet

Pairs use a spreadsheet to predict step counts for linear and binary search at sizes n = 10, 100, 1,000, and 10,000. They graph both lines on the same axes and annotate where the gap becomes significant. Produces a shareable artifact and makes the scaling difference immediately visual.

Predict the number of steps required for each search method on a given dataset.

Facilitation Tip

In Collaborative Investigation: Step Count Spreadsheet, model one row together to ensure students track midpoint, comparison, and remaining range correctly before they work independently.

What to look for

Provide students with two code snippets, one implementing linear search and one implementing binary search. Ask them to identify which is which, and write one sentence explaining the primary condition under which binary search is significantly more efficient.

• Analyze
• Evaluate
• Create
• Self-Management
• Self-Awareness

Activity 04

• Simulation Game
• 30 min · Pairs

Debugging Challenge: Broken Binary Search

Provide students with a binary search implementation containing a common off-by-one error or incorrect boundary condition. In pairs, students trace through the code on a specific dataset, identify exactly where it fails, and fix it. Connects the algorithm to real implementation pitfalls that arise even when the logic is understood.

Differentiate between linear and binary search in terms of efficiency.

Facilitation Tip

During Debugging Challenge: Broken Binary Search, circulate with a list of common errors to spot them quickly and guide students to fix logic rather than syntax first.

What to look for

Present students with a sorted list of 16 numbers and a target value. Ask them to trace the steps of a binary search, writing down each midpoint and comparison. Then, ask them to do the same for a linear search and compare the number of steps.

• Apply
• Analyze
• Evaluate
• Create
• Social Awareness
• Decision-Making

A few notes on teaching this unit

Teach this topic by letting students first experience linear search’s simplicity, then introducing binary search’s power through guided discovery. Avoid rushing to formulas—instead, have students count steps manually to build intuition. Research shows that physical reenactment and collaborative counting help students internalize logarithmic scaling better than abstract explanations alone.

Success looks like students confidently explaining why sorting matters for binary search and when to choose one algorithm over the other. They should trace search steps precisely, count comparisons accurately, and justify algorithm choices based on data size and order.

---

Watch Out for These Misconceptions

• During Role Play: Find the Number, watch for students assuming binary search works on any list, even when they see peers struggle with unsorted data.

  Pause the role play after the first round with an unsorted list and ask students to predict where binary search would go wrong, then rearrange the list to sorted order to show the correction.

• During Think-Pair-Share: When Does Binary Search Break?, listen for students saying binary search always cuts steps to two or three regardless of list size.

  Have students calculate log₂(n) for n=16 and n=1024 using the data from the sorted list they worked with, then physically count the steps to verify the formula.

---

Methods used in this brief

• Role Play
• Think-Pair-Share
• Inquiry Circle
• Simulation Game