Insertion sort

Computing

Algorithms

"The insertion sort algorithm works by grouping the items in a list into two parts: a sorted sublist and an unsorted sublist."

"With each pass through the list, an item from the unsorted sublist is compared to items in the sorted sublist until it is inserted into the correct position."

"If the item at the current position is greater than value, copy it into the next item and move on to the previous item in the list"

"Insertion sort compares an item from the unsorted sublist with the items in the sorted sublist and places it in the correct position."

"Insertion sort is usually slower to execute than bubble sort on large, unordered data sets."

"During a pass of an insertion sort, elements in the sorted part of the list are copied into the next position, to make space for the value to be inserted."

"If the item at the current position is greater than the one next to it, swap the items within the list"

"A single pass results in the smallest element reaching its final position at the end of the list"

"The number of comparisons made in a single pass is always equal to the number of pairs you pass over"

This lesson will be removed by end of Summer Term 2025.

Insertion sort

Lesson outcome

This lesson will be removed by end of Summer Term 2025.