Bubble sort, selection sort, and insertion sort algorithms are compared in this Grade 10 Computer Science worksheet on algorithms and computational thinking. Students trace how values move through each sorting method, record changes after passes, and use swaps and shifts to explain differences in algorithm behavior.

See how each sorting algorithm behaves

Students examine three distinct approaches to arranging data. Bubble sort compares neighboring elements and swaps them when they are out of order, causing larger values to move toward the end of the list. Selection sort searches the unsorted portion for the smallest remaining value and moves it into position. Insertion sort builds a sorted portion by taking the next element and shifting larger values until the correct position is available.

Rather than stopping at definitions, the worksheet asks students to reason through sorting traces. Learners identify swaps and shifts, predict the next state of a list, follow passes, and compare the operations used by each algorithm. They also explore why insertion sort can require fewer shifts when data is already nearly sorted and why selection sort may use fewer swaps than bubble sort in many cases.

Practice from vocabulary to comparison

Activities include a dialogue, concept matching, a cloze passage, diagram labeling, a reading passage, multiple-choice questions, true-or-false questions, brief written responses, and an extended response. These tasks give students opportunities to recognize sorting concepts, trace list changes, explain algorithm steps, and compare efficiency characteristics for different inputs.

The extended response asks students to choose two sorting algorithms and compare how they work using passes, swaps, and shifts. Students then consider which type of input, such as a nearly sorted or random list, each method is likely to handle more efficiently.

Included with the resource

• Grade 10 Computer Science worksheet focused on bubble, selection, and insertion sort
• Separate Teacher Guide PDF with learning objectives, teaching tips, discussion questions, and common mistakes

Use it for algorithm reasoning

This sorting algorithms worksheet can support instruction when introducing common sorting methods, reinforcing trace tables and list states, or reviewing algorithm behavior before programming implementations. It works well for guided practice, independent work, or discussion centered on why different algorithms perform different operations on the same data.

By connecting each sorting method to visible list changes, students can compare algorithms using evidence from their traces rather than memorizing names alone. That emphasis supports computational thinking about how an algorithm reaches a sorted result and what operations it performs along the way.