Sorting Algorithms (Selection & Bubble)

Active learning works well for sorting algorithms because the step-by-step nature of these processes is best understood through physical and visual engagement. When students manipulate objects or trace processes themselves, they internalize how each comparison and swap contributes to the final sorted array, making abstract time complexity concepts concrete.

• Grade 10
• Computer Science
• 4 activities
• 25 min–45 min

Learning Objectives

1. Demonstrate the step-by-step execution of selection sort and bubble sort on a given array of numbers.
2. Calculate the number of comparisons and swaps performed by selection sort and bubble sort for a small dataset.
3. Compare the efficiency of selection sort and bubble sort by analyzing their time complexity in Big O notation.
4. Differentiate between stable and unstable sorting algorithms, providing examples of each.
5. Analyze how the initial order of elements affects the performance of bubble sort.

Experiential Learning

⏱ 35 min·Small Groups

Hands-On: Bubble Sort Cards

Provide decks of numbered cards to small groups. Students line up cards, perform passes by comparing and swapping adjacent pairs aloud, and record swaps per pass. Discuss when the sort completes. Extend by timing sorts of 10 versus 20 cards.

Prepare & details

Explain the step-by-step process of selection sort and bubble sort.

Facilitation Tip: Before Bubble Sort Cards, give each pair a small deck of numbered index cards and ask them to predict how many passes they think it will take to sort the deck completely.

Setup: Varies; may include outdoor space, lab, or community setting

Materials: Experience setup materials, Reflection journal with prompts, Observation worksheet, Connection-to-content framework

• Apply
• Analyze
• Evaluate
• Self-Awareness
• Self-Management
• Social Awareness

Experiential Learning

⏱ 25 min·Pairs

Partner Tracing: Selection Sort

Pairs receive printed arrays on worksheets. One student reads array values while the partner identifies the minimum in the unsorted section and simulates the swap. Switch roles after each pass, then verify the final sorted array together.

Prepare & details

Analyze the time complexity of basic sorting algorithms.

Facilitation Tip: For Partner Tracing: Selection Sort, provide colored pencils so students can highlight the sorted and unsorted portions of the array after each pass.

Setup: Varies; may include outdoor space, lab, or community setting

Materials: Experience setup materials, Reflection journal with prompts, Observation worksheet, Connection-to-content framework

• Apply
• Analyze
• Evaluate
• Self-Awareness
• Self-Management
• Social Awareness

Experiential Learning

⏱ 45 min·Small Groups

Efficiency Race: Algorithm Showdown

Whole class divides into teams. Teams manually sort arrays of increasing sizes using selection or bubble sort while a timer runs. Chart comparisons and swaps, then predict results for n=50. Debrief on O(n²) growth.

Prepare & details

Differentiate between stable and unstable sorting algorithms.

Facilitation Tip: During Efficiency Race: Algorithm Showdown, set a timer for 2 minutes and have students record both swap counts and operation counts for each algorithm to compare visibly on the board.

Setup: Varies; may include outdoor space, lab, or community setting

Materials: Experience setup materials, Reflection journal with prompts, Observation worksheet, Connection-to-content framework

• Apply
• Analyze
• Evaluate
• Self-Awareness
• Self-Management
• Social Awareness

Experiential Learning

⏱ 40 min·Individual

Code vs Manual: Hybrid Sort

Individuals code one algorithm in Python or pseudocode, test on sample arrays. Then, in pairs, compare runtime outputs to prior manual timings. Adjust code to visualize passes with print statements.

Prepare & details

Explain the step-by-step process of selection sort and bubble sort.

Facilitation Tip: In Code vs Manual: Hybrid Sort, ask students to prepare a short reflection on which method felt more intuitive for them and why.

Setup: Varies; may include outdoor space, lab, or community setting

Materials: Experience setup materials, Reflection journal with prompts, Observation worksheet, Connection-to-content framework

• Apply
• Analyze
• Evaluate
• Self-Awareness
• Self-Management
• Social Awareness

Teaching This Topic

Teachers approach this topic by first emphasizing the importance of tracing algorithms manually before moving to code. Students often grasp the logic better when they physically perform the steps, so avoid rushing to implementation. Research shows that concrete examples reduce cognitive load when introducing abstract concepts like time complexity. Encourage students to verbalize each step as they work to reinforce understanding.

What to Expect

By the end of these activities, students will trace both selection and bubble sort algorithms independently, accurately count operations, and explain why both have O(n²) time complexity. They will also recognize when stability matters in sorting and justify algorithm choice based on context.

Watch Out for These Misconceptions

Common Misconception

During Bubble Sort Cards, watch for students who believe the sort completes after one pass through the deck.

What to Teach Instead

Pause the activity after the first pass and ask students to recount swaps and explain why the array might still be unsorted, reinforcing that multiple passes are needed until no swaps occur.

Common Misconception

During Efficiency Race: Algorithm Showdown, watch for students who assume selection sort always performs fewer total operations than bubble sort.

What to Teach Instead

Have students tally swaps and comparisons separately for each algorithm during the race and compare totals side by side to see that neither consistently dominates the other.

Common Misconception

During Hands-On: Bubble Sort Cards, watch for students who dismiss stability as irrelevant because all elements are unique in their examples.

What to Teach Instead

Introduce a second set of cards with duplicate values (e.g., two 3s) and ask students to sort them, then observe whether their original order is preserved to highlight stability's importance.

Assessment Ideas

Quick Check

After Partner Tracing: Selection Sort, provide students with a small unsorted array (e.g., [7, 3, 5, 1]). Ask them to trace the steps of selection sort on paper, showing the array after each pass and counting the total number of swaps. Then, ask them to do the same for bubble sort.

Discussion Prompt

After Hands-On: Bubble Sort Cards, pose the question: 'Imagine you are sorting a list of student names alphabetically. If two students have the same last name, should their relative order matter? Which sorting algorithm would you choose if you wanted to guarantee their original order is maintained, and why?'

Exit Ticket

During Code vs Manual: Hybrid Sort, have students write down the Big O time complexity for both selection sort and bubble sort on an index card. Then, ask them to explain in one sentence why these algorithms are considered inefficient for very large datasets based on their experience with the activities.

Extensions & Scaffolding

• Challenge students to create a hybrid sort that combines the fewest swaps of selection sort with the fewest comparisons of bubble sort, then test it on larger arrays.
• For students who struggle, provide pre-traced arrays with some steps filled in and ask them to complete the remaining passes.
• Deeper exploration: Have students research and present on real-world scenarios where sorting stability is critical, such as sorting database records or event logs.

Key Vocabulary

Selection Sort	A sorting algorithm that repeatedly finds the minimum element from the unsorted part of an array and puts it at the beginning.
Bubble Sort	A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
Time Complexity	A measure of how the runtime of an algorithm grows as the input size increases, often expressed using Big O notation.
Stable Sort	A sorting algorithm that preserves the relative order of equal elements in the input array.
Unstable Sort	A sorting algorithm that does not guarantee the preservation of the relative order of equal elements.