Computing · Year 10

Active learning ideas

Merge Sort and Quick Sort (Introduction)

Merge Sort and Quick Sort rely on abstract recursive logic that students grasp better through physical and visual manipulation than through lectures alone. Active learning lets students feel the divide-and-conquer process with their hands and eyes, building durable mental models of recursion, partitioning, and merging that static slides cannot convey.

• National Curriculum Attainment Targets
• GCSE: Computing - Computational Thinking and Algorithms

• 20–50 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Case Study Analysis
• 30 min · Pairs

Card Sort: Merge Sort Physical Demo

Provide shuffled number cards to pairs. Students divide the deck in half, recursively sort each half by hand, then merge by comparing top cards. Discuss merging steps aloud. Extend to trace on paper for larger sets.

Analyze the 'divide and conquer' strategy employed by Merge Sort and Quick Sort.

Facilitation Tip

During the Card Sort: Merge Sort Physical Demo, circulate with a timer and call out when groups should explicitly state their base case before merging.

What to look for

Provide students with a small, unsorted array (e.g., [5, 2, 8, 1, 9]). Ask them to trace the first step of Quick Sort, identifying the chosen pivot and showing the array after partitioning. Then, ask them to trace the first step of Merge Sort, showing the two subarrays created.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 02

• Stations Rotation
• 45 min · Small Groups

Stations Rotation: Quick Sort Pivots

Set up stations with pre-sorted card sets. Groups pick different pivots, partition cards, and recurse twice. Rotate stations, noting how pivot choice affects partitions. Record swaps per method.

Evaluate the trade-offs between the speed of Merge Sort and the in-place nature of Quick Sort.

Facilitation Tip

For Station Rotation: Quick Sort Pivots, prepare three stations with different pivot strategies and give each group exactly seven minutes to document how each pivot choice affects partitioning.

What to look for

Pose the question: 'Imagine you have a dataset that is already sorted. Which algorithm, Merge Sort or Quick Sort, would likely perform better and why? Consider both average and worst-case scenarios.' Facilitate a class discussion where students justify their predictions.

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

Activity 03

• Case Study Analysis
• 50 min · Pairs

Pair Programming: Implement and Time

Pairs code Merge Sort and Quick Sort in Python, using random lists of 100-1000 elements. Time runs with timeit module. Graph results and discuss dataset size impacts.

Predict how the size of a dataset influences your choice of sorting algorithm.

Facilitation Tip

In Pair Programming: Implement and Time, require pairs to print their timing results on a shared poster with space for peers to comment on readability and correctness.

What to look for

On an exit ticket, ask students to write one sentence explaining the main advantage of Merge Sort and one sentence explaining the main advantage of Quick Sort, referring to their space or time efficiency.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 04

• Case Study Analysis
• 20 min · Whole Class

Whole Class Debate: Trade-offs

After simulations, project efficiency tables. Class votes on best algorithm for scenarios like stable sort or huge data. Debate evidence from activities.

Analyze the 'divide and conquer' strategy employed by Merge Sort and Quick Sort.

Facilitation Tip

During Whole Class Debate: Trade-offs, assign two students to track recurring arguments on the board and redirect the discussion when claims lack evidence from prior activities.

What to look for

Provide students with a small, unsorted array (e.g., [5, 2, 8, 1, 9]). Ask them to trace the first step of Quick Sort, identifying the chosen pivot and showing the array after partitioning. Then, ask them to trace the first step of Merge Sort, showing the two subarrays created.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

A few notes on teaching this unit

Teachers should start with concrete comparisons to simpler sorts so students see why recursion is needed for efficiency. Avoid rushing to code—first build intuition with physical arrays, then connect the steps to pseudocode. Research shows that tracing small, labeled arrays on paper reduces confusion about recursion depth and merge logic far more than abstract diagrams alone.

Successful learning looks like students confidently tracing recursive calls, justifying pivot choices, and comparing time and space trade-offs between the algorithms. They should articulate why Merge Sort is stable and why Quick Sort can fail with bad pivots, using evidence from their own implementations and timed trials.

---

Watch Out for These Misconceptions

• During Card Sort: Merge Sort Physical Demo, watch for students who stop splitting once arrays look small without identifying single-element arrays as base cases.

  Pause the activity after four splits and ask each group to hold up the smallest array they created, then label it as the base case that stops recursion.

• During Station Rotation: Quick Sort Pivots, watch for students who assume the first element is always the best pivot.

  Provide a small sorted array at one station and guide students to observe how the first element leads to unbalanced partitions and O(n^2) behavior.

• During Whole Class Debate: Trade-offs, watch for claims that Merge Sort and Quick Sort behave the same on any data, especially with duplicate numbers.

  Run a quick example with duplicates on the board and ask students to trace Merge Sort’s merging step to see stability, then contrast it with Quick Sort’s partitioning outcome.

---

Methods used in this brief

• Case Study Analysis
• Stations Rotation