Computer Science

a sorting algorithm that progressively evaluates items in a list and inserts them into the correct place in an ordered sublist

sorted values held in the lower positions of the list

unsorted values held in the higher positions of the list

Insertion sort

In this unit pupils will have opportunities to analyse, interpret, modify, and implement a range of searching and sorting algorithms. They will have the opportunity to compare the features and efficiency of these algorithms and make suggestions about the most suitable algorithm for a given task.

Searching and sorting algorithms

What are the two parts of a list in an insertion sort?

into its correct position in the sorted sublist

During an insertion sort, where is the current item placed?

What is one real-world example of using an insertion sort?

it works well with small or partially sorted lists

Why might insertion sort be faster than other algorithms in some cases?

compare the current item to the sorted sublist

insert the item into the correct position

repeat for all items in the unsorted sublist

Place the steps of an insertion sort in the correct order:

it is placed at the start of the sorted sublist

What happens if the current item is smaller than all items in the sorted sublist?

Which of these best describes the process of splitting in merge sort?

they are combined into a single sorted list

What happens to unsorted sublists during merging in merge sort?

What is the main advantage of merge sort compared to bubble sort?

Which of these is a characteristic of a divide and conquer algorithm?

to store sublists during splitting and merging

Why does merge sort require extra memory?

it is always the fastest sorting algorithm

Which of these is NOT true about merge sort?

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.