Computer Science · 10th Grade

Active learning ideas

Basic Sorting Algorithms: Selection & Bubble Sort

Active learning works especially well for basic sorting algorithms because students need to see the step-by-step mechanics to truly grasp how elements move and swap. Watching a human perform the algorithm or tracing a list by hand makes abstract comparisons concrete, turning invisible operations into visible actions.

• Common Core State Standards
• CSTA: 3A-AP-15

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

Activity 01

• Role Play
• 25 min · Whole Class

Role Play: Human Sorting

Assign each student a number card and have the class stand in a row. A volunteer directs classmates using either selection or bubble sort rules while the class counts swaps and comparisons aloud. Running both algorithms on the same starting arrangement makes the comparison direct and the step counts immediately comparable.

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

Facilitation Tip

During Human Sorting, stand back and let students self-organize the steps so the process emerges from their own actions, not your instructions.

What to look for

Provide students with a list of 5 numbers (e.g., [5, 1, 4, 2, 8]). Ask them to write down the state of the list after the first pass of bubble sort, and the state after the first pass of selection sort. This checks their understanding of the initial steps.

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

Activity 02

• Gallery Walk
• 40 min · Small Groups

Gallery Walk: Trace the Algorithm

Post four large partially-worked sorting traces on the walls, two for selection sort and two for bubble sort, each on a different starting array. Students rotate in small groups, complete the next two steps of each trace, and annotate what operation just occurred. Surfaces errors and builds fluency with algorithm mechanics across both approaches.

Compare the efficiency of bubble sort versus selection sort.

Facilitation Tip

In Gallery Walk, place tracing sheets in clear page protectors so students can annotate with dry-erase markers without damaging the originals.

What to look for

Pose the question: 'Imagine you have 100,000 student records to sort by GPA. Would bubble sort or selection sort be a good choice? Explain why or why not, referencing the number of operations each algorithm performs.'

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

Activity 03

• Think-Pair-Share
• 20 min · Pairs

Think-Pair-Share: Is Bubble Sort Ever Useful?

Present the early-exit optimization for bubble sort, which stops if no swaps occurred during a pass. Pairs discuss when this makes bubble sort practical compared to selection sort, then share with the class. Introduces the idea that algorithmic modifications can change practical performance even within the same worst-case complexity class.

Critique the practical applicability of these basic sorting methods for large datasets.

Facilitation Tip

During Think-Pair-Share, assign pairs randomly using numbered popsicle sticks to ensure diverse perspectives during the discussion.

What to look for

Ask students to write down one advantage and one disadvantage of using selection sort compared to bubble sort. They should also identify which algorithm they would prefer to use if they had to sort 20 items by hand and why.

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

Activity 04

• Inquiry Circle
• 45 min · Pairs

Inquiry Circle: Comparison Counter

Pairs implement both algorithms with a counter variable that tracks comparisons and swaps. They run both on sorted, reverse-sorted, and random arrays of sizes 10, 50, and 100, recording results in a shared table. The data directly supports reasoning about best, worst, and average cases with real numbers rather than theory alone.

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

Facilitation Tip

For Comparison Counter, provide a printed tally sheet with columns for passes and comparisons so students focus on counting, not formatting.

What to look for

Provide students with a list of 5 numbers (e.g., [5, 1, 4, 2, 8]). Ask them to write down the state of the list after the first pass of bubble sort, and the state after the first pass of selection sort. This checks their understanding of the initial steps.

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

A few notes on teaching this unit

Teachers find success by teaching these algorithms side-by-side on the same array so students notice the permanent placement in selection sort versus the shifting in bubble sort. Avoid rushing to efficiency discussions before students can trace the steps manually. Research suggests that tactile and visual methods build stronger mental models than abstract explanations alone.

Successful learning looks like students confidently tracing both algorithms on paper, explaining why selection sort places elements permanently but bubble sort requires multiple passes. They should also articulate the trade-offs between the two algorithms using evidence from their hands-on work.

---

Watch Out for These Misconceptions

• During Role Play: Human Sorting, watch for students who insist the name 'bubble sort' means it is the best basic sorting algorithm.

  Direct students to focus on the movement of elements by having them perform the human sort twice: once with the smallest value moving left to right, and once with the largest value moving left to right. Ask them to describe which movement looks like bubbles rising.

• During Gallery Walk: Trace the Algorithm, watch for students who assume an element placed by selection sort might move again later.

  Have students mark each placed element with a unique symbol (like a star) on their tracing sheets, then revisit the same sheet after tracing both algorithms to see which algorithm leaves permanent marks and which allows elements to shift in later passes.

---

Methods used in this brief

• Role Play
• Gallery Walk
• Think-Pair-Share
• Inquiry Circle