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.

• 10th Grade
• Computer Science
• 4 activities
• 20 min–45 min

Learning Objectives

1. Explain the step-by-step mechanics of selection sort by tracing its execution on a small, unsorted array.
2. Compare the number of comparisons and swaps performed by bubble sort and selection sort on identical datasets.
3. Critique the time complexity of bubble sort and selection sort, identifying scenarios where their O(n^2) performance is impractical.
4. Implement bubble sort and selection sort in a programming language, demonstrating their functional correctness.
5. Analyze the trade-offs between simplicity and efficiency for basic sorting algorithms.

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.

Prepare & details

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.

Setup: Open space or rearranged desks for scenario staging

Materials: Character cards with backstory and goals, Scenario briefing sheet

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

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.

Prepare & details

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.

Setup: Wall space or tables arranged around room perimeter

Materials: Large paper/poster boards, Markers, Sticky notes for feedback

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

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.

Prepare & details

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.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

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.

Prepare & details

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.

Setup: Groups at tables with access to source materials

Materials: Source material collection, Inquiry cycle worksheet, Question generation protocol, Findings presentation template

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

Teaching This Topic

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.

What to Expect

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

Common Misconception

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

What to Teach Instead

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.

Common Misconception

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

What to Teach Instead

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.

Assessment Ideas

Quick Check

After Human Sorting, give students a list of 5 numbers and ask them to write down the state of the list after the first pass of bubble sort and after the first pass of selection sort on the same sheet.

Discussion Prompt

During Think-Pair-Share, have pairs discuss their answers to 'Would bubble sort or selection sort work for 100,000 student records?' and record the pros and cons they identify on a shared poster.

Exit Ticket

After Collaborative Investigation, ask students to write one advantage and one disadvantage of selection sort compared to bubble sort, and explain which algorithm they would prefer for sorting 20 items by hand using evidence from their comparison charts.

Extensions & Scaffolding

• Challenge: Ask students to modify bubble sort to stop early if no swaps occur in a pass, then compare its performance on nearly-sorted data.
• Scaffolding: Provide partially filled tracing sheets for students to complete during Gallery Walk, showing only the first two steps.
• Deeper exploration: Have students write pseudocode for selection sort that starts from the end of the list instead of the beginning, then test it on sample arrays.

Key Vocabulary

In-place sorting	A sorting algorithm that sorts a list by modifying it directly, without requiring significant additional memory space.
Comparison sort	A sorting algorithm that sorts data by comparing pairs of elements to determine their correct order.
Time complexity	A measure of how the runtime of an algorithm grows as the input size increases, often expressed using Big O notation.
Adjacent swap	An operation in bubble sort where two elements that are next to each other in the list are exchanged if they are in the wrong order.