Computer Science

a sorting algorithm that works by repeatedly splitting data into sublists and merging pairs of sublists, ordering the items as they are merged

the initial step of dividing an unsorted list into smaller sublists

the process of combining two already sorted lists into a single, larger sorted list

Merge 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

a sorting algorithm that splits and merges data

combining sorted sublists into a single list

to combine sorted sublists into a single sorted list

What is the purpose of merging in merge sort?

Place the steps of merge sort in the correct order:

Which is faster for smaller data sets: merge sort or bubble sort?

What sorting algorithm repeatedly compares pairs of values within a list and swaps them if they are out of order?

What happens if two adjacent items are in the wrong order in bubble sort?

When does bubble sort stop making passes?

Which of these is a disadvantage of bubble sort?

Place the steps of bubble sort in the correct order:

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

Merge sort

Lesson outcome

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