Computing · Year 8

Active learning ideas

Introduction to Algorithms in Python

Active learning works for algorithms because students grasp efficiency and logic only when they see code run, time runs, and data rearrange. Writing and debugging search or sort routines forces them to confront misconceptions in real time, turning abstract ideas into concrete evidence.

• National Curriculum Attainment Targets
• KS3: Computing - Algorithms
• KS3: Computing - Programming and Development

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

Activity 01

• Stations Rotation
• 30 min · Pairs

Pair Programming: Linear vs Binary Search

Pairs write Python functions for linear and binary search on lists of 10-100 items. They time each using time module, then swap code to test and debug. Discuss which performs better on sorted data.

Compare the efficiency of a linear search versus a binary search algorithm.

Facilitation Tip

During Pair Programming: Linear vs Binary Search, assign roles clearly and have partners swap roles after each search to share cognitive load.

What to look for

Present students with a small, unsorted list of numbers and a target value. Ask them to manually trace the steps of a linear search and a binary search, recording the number of comparisons each algorithm makes.

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

Activity 02

• Stations Rotation
• 45 min · Small Groups

Small Groups: Bubble Sort Visualiser

Groups code a bubble sort function and add print statements to show swaps step-by-step. They run it on varied lists, draw flowcharts of passes, and predict iterations needed.

Construct a Python function to implement a simple sorting algorithm.

Facilitation Tip

When running the Small Groups: Bubble Sort Visualiser, provide colored cards to represent swaps so students can physically see the passes.

What to look for

Provide students with a Python code snippet for either linear search or bubble sort. Ask them to write one sentence explaining its purpose and one sentence describing a scenario where it might be inefficient.

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

Activity 03

• Stations Rotation
• 40 min · Whole Class

Whole Class: Algorithm Efficiency Challenge

Class generates large lists together. Students vote on search methods, run timed trials projected on screen, and graph results to compare linear O(n) and binary O(log n) growth.

Explain how algorithmic complexity impacts program performance.

Facilitation Tip

In the Whole Class: Algorithm Efficiency Challenge, supply pre-made lists of increasing size so every group tests the same inputs and comparisons are fair.

What to look for

Pose the question: 'Imagine you have a list of 1 million student IDs to search. Would you choose linear search or binary search? Explain your reasoning, considering the time it would take for each.'

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

Activity 04

• Stations Rotation
• 20 min · Individual

Individual: Custom Sort Extension

Each student modifies their sort function for descending order or specific data types. They test edge cases like empty lists, then share one optimised version with the class.

Compare the efficiency of a linear search versus a binary search algorithm.

What to look for

Present students with a small, unsorted list of numbers and a target value. Ask them to manually trace the steps of a linear search and a binary search, recording the number of comparisons each algorithm makes.

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

A few notes on teaching this unit

Teachers approach this topic by letting students experience the pain of inefficiency first. Avoid lecturing on Big O; instead, have them run bubble sort on a 100-item list and time it. Emphasize tracing code with print statements or a visualiser before abstracting patterns. Research shows concrete timing data reduces misconceptions about speed more effectively than theoretical slides.

Successful learning looks like students who can explain why bubble sort needs multiple passes, justify the sorted-data requirement for binary search, and predict which algorithm is faster on large inputs. They should also be able to trace each algorithm step-by-step on paper and in code.

---

Watch Out for These Misconceptions

• During Pair Programming: Linear vs Binary Search, watch for students who assume both searches work on unsorted data without recognizing the importance of sorted lists for binary search.

  Pause the pair programming session after the first unsorted list run and ask each pair to predict how many comparisons binary search will make, then run it to confirm. Use their data to highlight the need for sorted input.

• During Small Groups: Bubble Sort Visualiser, watch for students who believe the algorithm randomly swaps until the list is sorted.

  Have groups pause after each pass and count the swaps aloud. Ask them to describe the pattern of comparisons and swaps, redirecting vague statements to precise step-by-step explanations.

• During Whole Class: Algorithm Efficiency Challenge, watch for students who equate more lines of code with faster performance.

  After timing runs, ask groups to refactor the bubble sort into a shorter version with the same logic and time both. Use the results to show that fewer lines do not always mean fewer operations.

---

Methods used in this brief

• Stations Rotation