- Mathematics
- Class 11
- Project 1
1The Sorting Race: Which Algorithm Wins?
Teams act as computers. Each team gets 16 shuffled number cards and must sort them using a strict set of rules: bubble sort for one team, selection sort for another, merge sort for a third. A referee counts every comparison. Teams then race with 32 cards and discover that some algorithms slow down far more than others as the list grows, which is the central idea of algorithm efficiency.
- Class and age
- Class 11 · 16–17
- Activity type
- Group
- Time needed
- 60 minutes
- Difficulty
- Medium
- Estimated budget
- ৳0–৳20
Mathematical concepts
- Algorithms as precise step-by-step rules
- Counting operations (comparisons)
- Growth of n² versus n log₂ n
- Best, worst and average cases
Learning objectives
- Follow and describe sorting algorithms exactly.
- Count the work an algorithm does.
- Compare how algorithms scale with input size.
- Explain why efficiency matters for big data.
Real-life connection
Search engines, banks and phone contact lists sort millions of items. Choosing an efficient algorithm can be the difference between an answer in a second and an answer in hours.
Materials required
- Sets of 16 and 32 number cards per team
- Printed rule cards for each algorithm
- Tally sheet for the referee, stopwatch
Step-by-step instructions
- Read the rule card for your algorithm. Practise on 6 cards until everyone can follow it exactly.
- Shuffle 16 cards. Sort them, with the referee counting every comparison of two cards.
- Record comparisons and time. Repeat with a new shuffle.
- Now sort 32 cards. Predict first: will the count double?
- Compare results across teams on the board.
- For bubble sort, find the worst case for n cards: n(n − 1) ÷ 2. For 16 cards that is 120 comparisons.
- For merge sort, see that the list is halved about log₂ n times, so the work grows like n log₂ n. For 16 cards it needs at most 49 comparisons.
- Estimate how long each method would take for 1,000,000 items if a computer makes a billion comparisons a second.
Mathematical explanation
Bubble sort compares neighbours and swaps them, passing through the list again and again. In the worst case it compares every pair, n(n − 1) ÷ 2 times, so doubling the list roughly quadruples the work. Merge sort splits the list in half repeatedly and merges sorted halves, doing about n comparisons at each of about log₂ n levels. For a million items, n² ÷ 2 is about 5 × 10¹¹ comparisons (several minutes at a billion a second) while n log₂ n is about 2 × 10⁷ (a fiftieth of a second). The way the work grows matters more than the speed of the computer.
Expected project output
A results table of comparisons for 16 and 32 cards, a growth graph and a short note on algorithm efficiency.
Skills developed
- Algorithmic thinking
- Counting and growth rates
- Precision in following rules
- Teamwork
Assessment criteria
- The algorithm is followed exactly.
- Comparisons are counted correctly.
- The growth from 16 to 32 cards is explained.
- The million-item estimate is sensible.
Extension challenge
Write one of the algorithms in Python or a block language, count comparisons automatically and plot them for lists of 10 to 1,000 items.
Safety and inclusion
No special safety needs. Keep the activity calm so that rules are followed precisely.