Introduction to Algorithms and Efficiency

Active learning works for algorithms and efficiency because students often struggle to grasp abstract concepts without hands-on practice. When they design, compare, and visualize algorithms themselves, they build lasting understanding of how steps translate into real-world performance.

• Class 12
• Computer Science
• 4 activities
• 15 min–30 min

Learning Objectives

1. Explain the fundamental definition of an algorithm and its role in problem-solving within computer science.
2. Compare at least two distinct methods for measuring algorithm efficiency, such as operation counting or time complexity.
3. Analyze how the number of operations in a simple algorithm, like linear search, scales with increasing input size.
4. Design pseudocode for a basic algorithm to solve a given problem, such as finding the maximum value in a list.

Chalk Talk

⏱ 25 min·Small Groups

Algorithm Design Challenge

Students create step-by-step instructions for everyday tasks like making tea. They share and refine them in class. This builds intuition for algorithms.

Prepare & details

Explain what an algorithm is and why it is crucial in computer science.

Facilitation Tip: During Algorithm Design Challenge, circulate to check that student teams specify inputs, outputs, and loop conditions explicitly.

Setup: Chart paper or newspaper sheets on walls or desks, or the blackboard divided into sections; sufficient space for 8 to 10 students to circulate around each station without crowding

Materials: Chart paper or large newspaper sheets arranged in 4 to 5 stations, Marker pens or sketch pens in different colours per group, Printed response scaffold cards from Flip, Phone or camera to photograph completed chart papers for portfolio records

• Understand
• Analyze
• Evaluate
• Self-Awareness
• Self-Management

Chalk Talk

⏱ 20 min·Pairs

Efficiency Race

Pairs time manual sorting of cards with different methods. They discuss why one takes longer as numbers increase. Links to computational efficiency.

Prepare & details

Analyze different ways to measure the 'efficiency' of an algorithm.

Facilitation Tip: For Efficiency Race, set a strict timer to force students to focus on counting operations rather than just getting the answer.

Setup: Chart paper or newspaper sheets on walls or desks, or the blackboard divided into sections; sufficient space for 8 to 10 students to circulate around each station without crowding

Materials: Chart paper or large newspaper sheets arranged in 4 to 5 stations, Marker pens or sketch pens in different colours per group, Printed response scaffold cards from Flip, Phone or camera to photograph completed chart papers for portfolio records

• Understand
• Analyze
• Evaluate
• Self-Awareness
• Self-Management

Chalk Talk

⏱ 15 min·Individual

Pseudocode Practice

Individuals write pseudocode for finding maximum in a list. Class reviews and improves them. Reinforces structure.

Prepare & details

Predict how a simple algorithm's performance might change with increasing input size.

Facilitation Tip: In Pseudocode Practice, provide a checklist of keywords to avoid natural language ambiguity.

Setup: Chart paper or newspaper sheets on walls or desks, or the blackboard divided into sections; sufficient space for 8 to 10 students to circulate around each station without crowding

Materials: Chart paper or large newspaper sheets arranged in 4 to 5 stations, Marker pens or sketch pens in different colours per group, Printed response scaffold cards from Flip, Phone or camera to photograph completed chart papers for portfolio records

• Understand
• Analyze
• Evaluate
• Self-Awareness
• Self-Management

Chalk Talk

⏱ 30 min·Small Groups

Flowchart Relay

Teams draw flowcharts for simple problems in turns. Corrects errors collectively. Fun way to visualise steps.

Prepare & details

Explain what an algorithm is and why it is crucial in computer science.

Facilitation Tip: During Flowchart Relay, insist each team presents its flowchart to another group for verification before moving on.

Setup: Chart paper or newspaper sheets on walls or desks, or the blackboard divided into sections; sufficient space for 8 to 10 students to circulate around each station without crowding

Materials: Chart paper or large newspaper sheets arranged in 4 to 5 stations, Marker pens or sketch pens in different colours per group, Printed response scaffold cards from Flip, Phone or camera to photograph completed chart papers for portfolio records

• Understand
• Analyze
• Evaluate
• Self-Awareness
• Self-Management

Teaching This Topic

Teachers should start with small, familiar problems so students see algorithms as everyday problem-solving tools before scaling up. Use tangible examples like marking papers or sorting bookshelves to make the abstract concrete. Avoid rushing to Big O notation; first build intuition with actual counts of steps.

What to Expect

By the end of these activities, students should be able to define an algorithm clearly, distinguish efficient from inefficient designs, and justify their choices with concrete reasons. They should also connect time and space complexity to real program behavior.

Watch Out for These Misconceptions

Common Misconception

During Algorithm Design Challenge, watch for students writing steps that depend on specific input sizes or leave key decisions open.

What to Teach Instead

Prompt them to generalize their algorithm by asking, 'What if this list had 100 numbers instead of 10? How would your steps change?'

Common Misconception

During Efficiency Race, listen for students calling an algorithm 'faster' without counting operations or comparing inputs.

What to Teach Instead

Ask them to tabulate steps for inputs of size 5, 10, and 15, then ask which growth pattern is gentler.

Common Misconception

During Pseudocode Practice, notice students using vague phrases like 'keep doing this' or 'find the best one'.

What to Teach Instead

Have them replace phrases with exact loop conditions and comparison operators, then check with a partner.

Assessment Ideas

Exit Ticket

After Algorithm Design Challenge, ask students to write: 1. Their algorithm in plain steps, 2. A reason why their design is efficient, 3. An input size they tested.

Quick Check

During Efficiency Race, give two sorting snippets: one with a nested loop and one without. Ask students to circle the more efficient one and count operations for an input of size 6.

Discussion Prompt

After Flowchart Relay, pose: 'If your flowchart had to handle 10,000 marks instead of 20, which shapes would slow down first? Why?'

Extensions & Scaffolding

• Challenge: Ask students to design an algorithm that sorts a list of 1000 marks in under 1 second using only 100 bytes of memory, then test it on a simulated dataset.
• Scaffolding: Provide prewritten pseudocode snippets with blanks for students to fill in the comparison operators or loop structures.
• Deeper exploration: Have students research real-world algorithms like QuickSort or Dijkstra’s and present their time and space trade-offs.

Key Vocabulary

Algorithm	A step-by-step procedure or set of rules designed to perform a specific task or solve a particular problem.
Efficiency	A measure of how well an algorithm performs in terms of the resources it consumes, typically time and memory.
Time Complexity	A way to describe how the runtime of an algorithm grows as the size of the input grows. It's often expressed using Big O notation.
Pseudocode	An informal, high-level description of the operating principle of a computer program or other algorithm, using conventions from programming languages but intended for human reading.
Input Size	The number of data items that an algorithm must process. For example, the number of elements in a list to be sorted.