Computing · Year 9

Active learning ideas

Introduction to Algorithms & Flowcharts

This topic thrives on movement and visual modeling because algorithms are abstract processes made concrete through physical action and structured diagrams. When students act out sorting or race to find items, they grasp why efficiency matters in real time, turning abstract Big O concepts into memorable experiences.

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

• 15–45 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Think-Pair-Share
• 20 min · Whole Class

Kinaesthetic Sorting: Human Bubble Sort

Line up ten students with different numbers on cards. Have them perform a bubble sort by comparing themselves to their neighbor and swapping if they are in the wrong order, repeating until the line is sorted. This helps students visualize the 'pass' mechanism and the inefficiency of the algorithm.

Explain how a simple everyday task can be broken down into a precise sequence of steps.

Facilitation Tip

During the Human Bubble Sort, have students call out each comparison step aloud so peers can hear how many operations occur, reinforcing the inefficiency of O(n²) in real time.

What to look for

Provide students with a simple task, such as brushing their teeth. Ask them to write down the algorithm as a numbered list and then draw a basic flowchart for the first three steps, labeling the start and end points.

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

Activity 02

• Inquiry Circle
• 15 min · Small Groups

Inquiry Circle: The Great Search Race

Provide one group with an ordered list of 100 items and another with an unordered list. Challenge them to find a specific item using linear search versus binary search. Groups record the number of 'guesses' or checks made to find the target, then present their findings to the class.

Compare the benefits of using a visual flowchart versus written instructions for an algorithm.

Facilitation Tip

For The Great Search Race, shuffle the deck only after students have predicted how long binary search will take, making the failure obvious when the data is unsorted.

What to look for

Pose the question: 'Imagine you are explaining how to use a new app to someone who has never seen it. Would you write a list of instructions or draw a flowchart? Explain your choice, considering the advantages and disadvantages of each format.'

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

Activity 03

• Stations Rotation
• 45 min · Small Groups

Stations Rotation: Algorithm Efficiency Lab

Set up three stations: one for Merge Sort using physical cups, one for Binary Search with a phone book, and one for Linear Search with a deck of cards. Students rotate through, timing how long each takes and noting the pros and cons of each method on a shared digital document.

Design a flowchart to guide someone through making a cup of tea.

Facilitation Tip

In the Algorithm Efficiency Lab, provide calculators so students can compute actual times for 10 vs. 1,000 items, linking their physical actions to numerical outcomes.

What to look for

Present students with a pre-drawn flowchart containing a common error, like a missing terminal symbol or an incorrect arrow direction. Ask them to identify the error and explain why it is incorrect according to flowchart conventions.

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

A few notes on teaching this unit

Teach this topic by first letting students experience the algorithms physically before introducing notation or vocabulary. Avoid starting with definitions of Big O; instead, let students measure and compare methods to discover inefficiencies themselves. Research shows that active, embodied learning cements understanding of algorithmic complexity better than passive explanation, so prioritize movement and real-world analogies over abstract graphs.

Students will explain the difference between linear and binary searches by timing their own searches, and they will compare sorting methods by physically acting out steps and recording data. Success looks like students using correct terminology to justify why one method is faster than another based on their observations.

---

Watch Out for These Misconceptions

• During the Human Bubble Sort, watch for students who assume any sorting method will require the same number of steps regardless of the data's initial order.

  After students act out bubble sort, pause the activity to reshuffle the deck randomly and repeat the process, asking students to compare the number of steps needed. This concrete comparison highlights how bubble sort's inefficiency grows with disorder.

• During The Great Search Race, watch for students who believe binary search can always halve the search space, even in unsorted data.

  Hand students a shuffled deck and ask them to perform binary search by calling out midpoints aloud. When they realize the process fails, have the class discuss why pre-sorting is a non-negotiable requirement for binary search.

---

Methods used in this brief

• Think-Pair-Share
• Inquiry Circle
• Stations Rotation