Computing · Secondary 4

Active learning ideas

Introduction to Algorithms and Problem Solving

Active learning works well for this topic because students need to physically experience inefficiencies to truly understand algorithmic complexity. Moving beyond abstract explanations helps them grasp why certain methods scale poorly or excel as data grows. Simulating processes like sorting and searching makes the hidden steps visible and memorable for young learners transitioning to O-Level rigor.

• MOE Syllabus Outcomes
• MOE: Computational Thinking - S4

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

Activity 01

• Simulation Game
• 30 min · Small Groups

Simulation Game: The Human Sort Race

Assign students random numbers on cards and have two groups compete to sort themselves. One group must follow the strict adjacent-swap logic of a Bubble Sort, while the other uses the divide-and-conquer approach of a Merge Sort to see which is faster as the 'list' grows.

Explain how algorithms are essential for solving everyday problems.

Facilitation Tip

During The Human Sort Race, assign roles clearly so students focus on the algorithm’s steps rather than social dynamics.

What to look for

Provide students with a simple everyday task, such as making a cup of tea. Ask them to write down the algorithm for this task in pseudocode or as a numbered list of steps. Then, ask them to identify one potential ambiguity or missing step in their algorithm.

• Apply
• Analyze
• Evaluate
• Create
• Social Awareness
• Decision-Making

Activity 02

• Think-Pair-Share
• 15 min · Pairs

Think-Pair-Share: Search Strategy Showdown

Give students a sorted list of 100 Singaporean landmarks and ask them to find 'Merlion Park'. They first brainstorm the maximum number of guesses needed for linear versus binary search, then pair up to prove their logic using a deck of cards.

Differentiate between an algorithm and a program.

Facilitation Tip

For Search Strategy Showdown, provide identical unsorted lists to each pair to highlight why binary search requires prior sorting.

What to look for

Pose the question: 'If an algorithm is a set of instructions, how is it different from a recipe?' Facilitate a class discussion where students compare and contrast the characteristics of algorithms and recipes, focusing on precision, universality, and execution context.

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

Activity 03

• Inquiry Circle
• 25 min · Small Groups

Inquiry Circle: Best Case vs Worst Case

Provide three sets of data: one already sorted, one reverse-sorted, and one random. Groups run a bubble sort on each and count the number of comparisons made, documenting why the 'best case' scenario drastically changes performance.

Analyze a given problem to identify its core components for algorithmic design.

Facilitation Tip

In Best Case vs Worst Case, use a visible timer to show how input order affects runtime, making the concept concrete.

What to look for

Present students with a complex problem, such as planning a school event. Ask them to identify and list at least three smaller sub-problems that need to be solved. This checks their ability to decompose a problem.

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

A few notes on teaching this unit

Experienced teachers introduce this topic by letting students experience the pain of inefficient methods firsthand. Avoid starting with definitions or theory, as students won’t grasp why optimizations matter. Instead, let them struggle with bubble sort on a large dataset, then introduce merge sort as a relief. Research shows this ‘productive failure’ approach builds deeper understanding than direct instruction alone. Always connect timing results back to real-world scenarios, like searching a phone contact list, to make the stakes clear.

Students will demonstrate understanding by accurately timing and comparing algorithms, explaining trade-offs between methods, and justifying their choices based on real data. They should articulate why some approaches fail on large datasets while others adapt. Look for clear reasoning about time complexity and precision in their analyses.

---

Watch Out for These Misconceptions

• During Search Strategy Showdown, watch for students who try binary search on an unsorted list without realizing it will fail.

  Pause the activity and ask pairs to attempt binary search on their unsorted list, then observe the incorrect results. Have them manually sort the list first, then repeat the search to see the difference. Discuss why the initial approach didn’t work.

• During The Human Sort Race, watch for students who assume bubble sort is efficient because it’s easy to describe.

  Have students time themselves performing bubble sort on a 20-item list, then time a peer using merge sort on the same list. Compare the two times and discuss how ease of coding doesn’t translate to speed or scalability.

---

Methods used in this brief

• Simulation Game
• Think-Pair-Share
• Inquiry Circle