Computing · Year 9 · Algorithmic Thinking and Logic · Autumn Term

Introduction to Algorithms & Flowcharts

Students will define algorithms and represent simple sequential processes using flowcharts.

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

About This Topic

Searching and sorting algorithms form the backbone of computational efficiency. In Year 9, students move beyond simply following instructions to analyzing why one method outperforms another as datasets grow. This topic introduces the concept of Big O notation informally by comparing linear and binary searches, alongside bubble and merge sorts. Understanding these processes is a core requirement of the KS3 National Curriculum, preparing students for the algorithmic complexity they will face at GCSE.

By exploring these algorithms, students develop a mental model for how computers handle vast amounts of data, from library databases to web search engines. It is not just about the code; it is about the logic of efficiency and resource management. This topic comes alive when students can physically model the data movements, using their peers or physical objects to visualize the comparisons and swaps that happen under the hood.

Key Questions

1. Explain how a simple everyday task can be broken down into a precise sequence of steps.
2. Compare the benefits of using a visual flowchart versus written instructions for an algorithm.
3. Design a flowchart to guide someone through making a cup of tea.

Learning Objectives

• Design a flowchart to represent a simple, sequential process.
• Explain the purpose of an algorithm in problem-solving.
• Compare the clarity of flowchart instructions versus written instructions for a given task.
• Identify the key symbols used in standard flowchart notation.
• Deconstruct an everyday task into a precise sequence of algorithmic steps.

Before You Start

Introduction to Computer Science Concepts

Why: Students need a basic understanding of what computers do and how they follow instructions before learning about algorithms.

Problem Solving Strategies

Why: This topic builds on the ability to break down problems into smaller, manageable parts.

Key Vocabulary

Algorithm	A set of step-by-step instructions or rules designed to solve a specific problem or perform a specific task.
Flowchart	A diagram that represents the steps in a process or workflow, using different shapes to denote actions, decisions, and start/end points.
Sequential Process	A series of actions or steps that must be performed in a specific order, one after another.
Input	Data or information that is fed into a process or algorithm.
Output	The result or outcome produced by a process or algorithm after processing the input.

Watch Out for These Misconceptions

Common Misconception

Binary search can be used on any list of data.

What to Teach Instead

Students often forget that binary search requires the data to be pre-sorted. Active modeling where students try to find a number in a shuffled deck using binary search quickly reveals why the logic fails without order.

Common Misconception

Merge sort is slower because it has more steps.

What to Teach Instead

While merge sort involves many recursive splits, it is significantly faster for large datasets than bubble sort. Using a simulation with 1,000 items versus 10 items helps students see that 'more steps' in code can lead to fewer total operations.

Active Learning Ideas

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.

20 min·Whole Class

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.

15 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.

45 min·Small Groups

Real-World Connections

• Traffic light systems use algorithms to control the flow of vehicles, ensuring safety and efficiency. Flowcharts can map out the logic for changing lights based on sensor data or fixed timings.
• Recipe instructions for cooking are essentially algorithms. A flowchart can visually represent the steps for baking a cake, making it easier for novice cooks to follow.
• Automated customer service phone systems guide callers through options using a decision tree, which is a form of flowchart, to direct them to the correct department or information.

Assessment Ideas

Exit Ticket

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.

Discussion Prompt

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.'

Quick Check

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.

Frequently Asked Questions

What is the difference between linear and binary search?

Linear search checks every item in a list one by one until the target is found. It works on any list. Binary search repeatedly halves the search area by checking the middle item, but it only works if the list is already sorted. Binary search is much faster for large amounts of data.

Why do we teach bubble sort if merge sort is better?

Bubble sort is an excellent teaching tool for introducing the concepts of loops, conditional statements, and swaps. It is easy to understand and implement, providing a foundation for students to appreciate why more complex algorithms like merge sort were developed.

How can active learning help students understand sorting algorithms?

Active learning, such as physical role plays or 'human' sorting, forces students to execute the logic themselves. When students physically swap places or divide a group in half, they internalize the 'if-then' logic and the repetitive nature of passes. This hands-on approach makes abstract computational steps tangible and memorable.

What are real-world examples of these algorithms?

Search engines use advanced versions of these algorithms to find web pages. Online shops use sorting to show you products from cheapest to most expensive. Even your phone's contact list uses these methods to quickly find a name as you type.