In-Class Activity: Visualizing Sorting Algorithms

Objective

This activity is designed to help you understand the step-by-step process of various sorting algorithms by working collaboratively to sort an array and document the steps. By the end of this activity, you’ll have a clear understanding of how the algorithms work and how they differ from each other.

Activity Overview

You will be divided into groups, and each group will be assigned one of the following sorting algorithms:

  1. Selection Sort
  2. Insertion Sort
  3. Bubble Sort
  4. Merge Sort

Your task is to:

  1. Sort a provided array using your assigned algorithm.
  2. Document every step of the sorting process.
  3. Present your findings to the class.

Time: 15 Minutes

Here is the array you will work with:

The Array

[34, 12, 45, 10, 56, 23, 4, 11]

Instructions

  1. Sorting the Array
    • Perform the sorting algorithm step-by-step on the array.
    • After each step, record the current state of the array, highlighting comparisons, swaps, or merges.
  2. Documenting the Process
    • Create a Google Doc titled “Sorting Steps: [Algorithm Name]”.
    • Include the following sections in your document:
      1. Algorithm Name: Title of your assigned algorithm.
      2. Initial Array: The array at the start.
      3. Step-by-Step Process: For each step, show the new array, with the elements that change position highlighted.
      4. Final Array: The fully sorted array.
      5. Explanation: A brief explanation of how your sorting algorithm works.
  3. Share Google Doc with instructor: skonjp@kenyon.edu
  4. Present to the Class
    • At the end of the activity, your group will present your Google Doc to the class.
    • Explain:
      • How the algorithm works.
      • Key steps of the sorting process.
      • Challenges or observations.

Sorting Algorithm Guidance

Selection Sort

  • Find the smallest element in the unsorted portion of the array.
  • Swap it with the first unsorted element.
  • Repeat for the next smallest element until the array is sorted.

Insertion Sort

  • Start from the second element.
  • Compare it with elements to its left and insert it into the correct position.
  • Repeat for all elements.

Bubble Sort

  • Compare adjacent elements and swap them if they are out of order.
  • Repeat until no swaps are needed (array is sorted).

Merge Sort

  • Recursively divide the array into halves until each subarray has one element.
  • Merge the subarrays back together in sorted order.

Expected Deliverables

  1. A Google Doc containing:
    • Step-by-step documentation of the sorting process.
    • Final sorted array.
    • Brief explanation of the algorithm.
  2. A class presentation summarizing your findings.

Discussion Questions

  • Which algorithm do you think is the most efficient for this array?
  • How does the number of comparisons or swaps differ between algorithms?
  • How might these algorithms perform differently with larger or already sorted arrays?
Scroll to Top