Computer Science · 11th Grade

Active learning ideas

Introduction to Sorting Algorithms: Bubble & Selection

Active learning works for Bubble and Selection Sort because students need to physically and cognitively experience the mechanical differences between these algorithms. Moving elements by hand or tracing each step with code helps students notice how swaps accumulate versus how comparisons lead directly to placements. This tactile and visual engagement bridges the gap between abstract complexity notation and concrete algorithm behavior.

• Common Core State Standards
• CSTA: 3B-AP-10

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

Activity 01

• Peer Teaching
• 30 min · Whole Class

Kinesthetic Activity: Be the Sort

Students stand in a line holding numbered cards. The class performs Bubble Sort (adjacent swaps) and then Selection Sort (find minimum, place in front) as a group. A timekeeper counts the total number of swaps or comparisons each method requires on the same starting arrangement.

Construct a step-by-step trace of Bubble Sort and Selection Sort.

Facilitation Tip

During Be the Sort, have students physically line up by height and sort themselves without speaking, then debrief how Bubble Sort’s adjacent swaps felt compared to Selection Sort’s targeted selections.

What to look for

Provide students with a small, unsorted list of numbers (e.g., [5, 1, 4, 2, 8]). Ask them to manually trace the first pass of Bubble Sort, showing each comparison and swap. Then, ask them to trace the first pass of Selection Sort, showing each comparison and the final swap for that pass.

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

Activity 02

• Peer Teaching
• 40 min · Pairs

Pair Coding: Side-by-Side Implementation

Pairs implement both Bubble Sort and Selection Sort in the same script, run them on identical datasets, and add counters to track the number of comparisons and swaps. Partners compare their counts and discuss which operation type each algorithm minimizes.

Compare the operational differences between Bubble Sort and Selection Sort.

Facilitation Tip

In Side-by-Side Implementation, pair students so one implements Bubble Sort while the other implements Selection Sort using the same starter code, then compare outputs and run times.

What to look for

On an index card, students write down one key difference in how Bubble Sort and Selection Sort move elements to their sorted positions. They should also list one reason why neither algorithm is suitable for sorting a list of one million items.

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

Activity 03

• Gallery Walk
• 30 min · Small Groups

Gallery Walk: Traced Arrays

Provide each group with a different starting array. Groups trace both sorts step-by-step on paper and post their traces on the wall. Other groups walk the gallery, check for errors, and annotate with observations about when each algorithm performs more or fewer swaps.

Evaluate the practical limitations of these simple sorting algorithms for large datasets.

Facilitation Tip

For Traced Arrays, provide blank tracing sheets with columns labeled 'Pass', 'Comparisons', 'Swaps', and 'Array State' to standardize student work during the Gallery Walk.

What to look for

Facilitate a class discussion using the prompt: 'Imagine you have a list of 100 student names to alphabetize for a small club roster. Would Bubble Sort or Selection Sort be a reasonable choice? Now, imagine you have a list of 100,000 student names for a school-wide event. What changes your answer, and why?'

• Understand
• Apply
• Analyze
• Create
• Relationship Skills
• Social Awareness

Activity 04

• Peer Teaching
• 20 min · Small Groups

Structured Discussion: Why Are These Slow?

Present a reverse-sorted array and ask small groups to count the maximum number of comparisons Bubble Sort would make. Groups report their counts, the class calculates the pattern, and together students articulate why O(n²) is the worst-case classification.

Construct a step-by-step trace of Bubble Sort and Selection Sort.

Facilitation Tip

In Why Are These Slow?, pose the swap cost question explicitly: 'If each swap takes 1 second, how long does Bubble Sort take on 100 items versus Selection Sort?' to anchor the discussion in concrete costs.

What to look for

Provide students with a small, unsorted list of numbers (e.g., [5, 1, 4, 2, 8]). Ask them to manually trace the first pass of Bubble Sort, showing each comparison and swap. Then, ask them to trace the first pass of Selection Sort, showing each comparison and the final swap for that pass.

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

A few notes on teaching this unit

Teachers should avoid rushing to big-O notation before students feel the algorithms in their bodies. Start with kinesthetic sorting so students internalize the mechanics, then move to code with deliberate tracing. Emphasize the swap/comparison trade-off rather than memorizing passes, and use hardware constraints as a hook to show why optimizations matter. Research shows that tracing small arrays by hand reduces later errors when implementing larger code.

Students will confidently trace both algorithms on small arrays, implement them in code, and articulate the mechanical differences between many small swaps and targeted placements. They will also justify why each algorithm’s O(n²) performance limits real-world use and explain when Selection Sort’s swap efficiency might be preferable in constrained systems.

---

Watch Out for These Misconceptions

• During Be the Sort, watch for students assuming that Bubble Sort and Selection Sort feel identical because both sort the array.

  Pause the activity after the first pass and ask students to describe how many swaps they made versus how many elements they locked into place. Highlight that Bubble Sort’s swaps happen one adjacent pair at a time, while Selection Sort’s placements lock the smallest element directly into its final slot.

• During Side-by-Side Implementation, watch for students conflating the number of comparisons with the number of swaps across both algorithms.

  After both pairs finish, bring the class together and ask each pair to report their swap and comparison counts for the same input. Create a class table to contrast Bubble Sort’s many swaps with Selection Sort’s fewer swaps, emphasizing the mechanical difference in their approaches.

• During Why Are These Slow?, watch for students dismissing both algorithms as useless after hearing they are O(n²).

  Refer back to the Gallery Walk traces and ask students to point to specific lines where Selection Sort’s fewer swaps might matter in a system that penalizes write operations. Ask them to explain why Bubble Sort’s early-exit optimization still leaves it inefficient for large datasets.

---

Methods used in this brief

• Peer Teaching
• Gallery Walk