Introduction to Algorithms

Active learning works because algorithms live in the space between thought and action. When students physically act out instructions, sort objects, or debate routes, they convert abstract definitions into concrete understanding. These movement-based tasks let them test ideas, fail safely, and revise quickly, which builds lasting comprehension of precision and efficiency in problem-solving.

• Grade 9
• Computer Science
• 4 activities
• 20 min–45 min

Learning Objectives

1. Define algorithm and identify its core characteristics: finiteness, definiteness, input, output, and effectiveness.
2. Compare and contrast two different algorithms designed to solve the same everyday problem, such as making toast.
3. Analyze the efficiency of a simple algorithm by counting the number of steps required to complete a task.
4. Construct a step-by-step algorithm for a common task, like packing a school backpack, using clear and unambiguous instructions.
5. Explain the role of algorithms in solving problems in both computational and non-computational contexts.

Think-Pair-Share

⏱ 30 min·Pairs

Pair Swap: Sandwich Algorithms

Pairs write a step-by-step algorithm for making a peanut butter sandwich using pseudocode. They swap papers, follow the instructions exactly, and note any unclear steps or errors. Pairs then revise based on feedback and share one improvement with the class.

Prepare & details

Compare and contrast different algorithms for solving the same problem.

Facilitation Tip: During Pair Swap: Sandwich Algorithms, give each pair identical ingredients but different instruction sets, one precise and one vague, to highlight how missing details break execution.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

Think-Pair-Share

⏱ 45 min·Small Groups

Small Group: Sorting Bead Challenge

Groups receive mixed beads and create two algorithms to sort them by color: one intuitive, one optimized. They test both on new sets, count steps, and graph efficiency. Discuss which performs best under time constraints.

Prepare & details

Analyze the efficiency of a simple algorithm based on its number of steps.

Facilitation Tip: During Small Group: Sorting Bead Challenge, provide identical sets of beads but vary the group size to show how larger inputs require more efficient logic.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

Think-Pair-Share

⏱ 25 min·Whole Class

Whole Class: Route Planning Debate

Display two algorithms for walking to school. Class analyzes steps for efficiency, votes on the best, and justifies with counts. Teacher facilitates by having volunteers act out each route.

Prepare & details

Construct an algorithm to solve a specific, everyday task.

Facilitation Tip: During Whole Class: Route Planning Debate, select a daily commute example so students connect algorithms to their own lives.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

Think-Pair-Share

⏱ 20 min·Individual

Individual: Daily Task Pseudocode

Students select a personal routine, like getting ready for school, and write an algorithm in pseudocode. They self-assess for definiteness and efficiency, then iterate once based on a checklist.

Prepare & details

Compare and contrast different algorithms for solving the same problem.

Facilitation Tip: During Individual: Daily Task Pseudocode, require students to time their own actions to prove efficiency is measurable, not just theoretical.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

Teaching This Topic

Start with the familiar and move to the formal. Teach algorithms by having students act out directions first, then map those actions to pseudocode. Avoid jumping straight to programming syntax; let the concept of unambiguous steps sink in through physical activity. Research shows that embodied cognition—moving and manipulating—strengthens understanding of abstract processes like sequencing and iteration. Also, use student errors as teachable moments: when instructions fail, pause to diagnose the ambiguity rather than fixing it for them.

What to Expect

Successful learning looks like students confidently identifying algorithm characteristics, critically evaluating step sequences, and revising vague instructions. They should articulate why fewer precise steps are better and recognize ambiguity when it appears. By the end, students can translate everyday tasks into numbered, unambiguous instructions and justify their choices with evidence from their work.

Watch Out for These Misconceptions

Common Misconception

During Pair Swap: Sandwich Algorithms, watch for students who assume algorithms only belong to computers.

What to Teach Instead

Have each pair follow their peer’s vague instructions to make a sandwich, then debrief: ask how confusion arose and why precise wording matters for humans too.

Common Misconception

During Small Group: Sorting Bead Challenge, watch for students who believe adding more steps improves the algorithm.

What to Teach Instead

Set a timer and have groups compare their step counts and total time to prove shorter, clearer steps work faster. Ask: 'How did extra steps slow you down?'

Common Misconception

During Individual: Daily Task Pseudocode, watch for students who think any list of instructions qualifies as an algorithm.

What to Teach Instead

Collect student drafts and redistribute them anonymously. Have peers follow the instructions and flag vague terms, then revise together in small groups.

Assessment Ideas

Exit Ticket

After Pair Swap: Sandwich Algorithms, provide two instruction sets for making toast. Ask students to circle the better algorithm and write two specific reasons, one about clarity and one about completeness.

Quick Check

During Small Group: Sorting Bead Challenge, have students submit their pseudocode for sorting beads by color. Count the steps and ask them to explain why their sequence is efficient or inefficient.

Discussion Prompt

During Whole Class: Route Planning Debate, pose: 'Can an algorithm have two correct outputs for the same input?' Use student examples from the activity to explore multiple valid solutions like shortest path vs. scenic route.

Extensions & Scaffolding

• Challenge: Ask students to design an algorithm for a task with hidden constraints, such as folding origami with only their non-dominant hand.
• Scaffolding: Provide sentence starters or fill-in-the-blank templates for pseudocode during Individual: Daily Task Pseudocode to support students with limited literacy.
• Deeper exploration: Introduce the concept of algorithms in nature, like leaf arrangement or bird flocking, and have students compare those to human-made sequences.

Key Vocabulary

Algorithm	A finite sequence of well-defined, unambiguous instructions, typically used to solve a class of specific problems or to perform a computation.
Input	The data or information that an algorithm receives to process.
Output	The result or data produced by an algorithm after processing the input.
Efficiency	A measure of how many steps an algorithm takes to complete its task, often used to compare different algorithms for the same problem.
Pseudocode	An informal, high-level description of the operating principle of a computer program or other algorithm, using natural language conventions rather than formal programming language syntax.