Starter Activity: Sorting Algorithms

Activity 1: Starter Question

Answer the quick questions to check your understanding of each algorithm.

1) Bubble sort: Which statement best describes bubble sort?

It compares adjacent items and swaps them if they are out of order. It inserts each item into its correct position one at a time. It uses divide and conquer: split lists in half, then merge them back together. It always finishes after a single pass through the list.

2) Merge sort: Which statement best describes merge sort?

It inserts each item into its correct position one at a time. It is only useful for very small data sets. It uses divide and conquer: split lists in half, then merge them back together. It only works when the list is already sorted.

3) Insertion sort: Which statement best describes insertion sort?

It compares adjacent items and swaps them if they are out of order. It inserts each item into its correct position one at a time. It uses divide and conquer: split lists in half, then merge them back together. It is only effective for very large data sets.

Activity 2: Sort the Features

Drag each feature into the algorithm it describes.

Divide and conquer: split then merge

Inserts each item into the correct position

Works very well for large data sets

Useful for small data sets

Adjacent lists are merged together

Useful for inserting items into a sorted list

Compares adjacent items and swaps if needed

Finishes when no more swaps are needed

Very easy to implement but inefficient

Popular for very small data sets

Merge sort

Drop cards here

Insertion sort

Drop cards here

Bubble sort

Drop cards here

Activity 3: Which Algorithm?

Use the definitions to decide what each statement describes.

“The data set is repeatedly split in half until each item is in its own list.”

“Each item is inserted into the correct place one at a time.”

“Adjacent lists are compared and merged to build a sorted list.”

“Best suited for small data sets and inserting into a sorted list.”

“Compares each item with the next and swaps if out of order.”

“Easy to implement but the most inefficient of these algorithms.”

Download PDF Evidence

Create a simple record of your work to submit or share.

Student name