# Algorithms review

## Lesson details

### Key learning points

1. In this lesson, we will practise and cement our knowledge of what we they have learnt in the algorithms unit. The worksheets contain a range of questions on flow charts, searching algorithms, and sorting algorithms that will help prepare us for the summative assessment for the unit.

### Licence

This content is made available by Oak National Academy Limited and its partners and licensed under Oak’s terms & conditions (Collection 1), except where otherwise stated.

## Video

Share with pupils

## Worksheet

Share with pupils

## Starter quiz

Share with pupils

### 8 Questions

Q1.
'The merge sort algorithm has two parts: splitting items and merging items'
False
Q2.
The first part of a merge sort it to repeatedly split a list in half until all the elements are in a list by themselves.
False
Q3.
Each stage of the merge sort algorithm can be shown in two parts: splitting the items and merging pairs of lists.
False
Q4.
The merge sort algorithm is less complex to implement than bubble sort.
True
Q5.
The advantage to merge sort is that it requires more memory, often due to the new lists that need to be created.
True
Q6.
"Executing a merge sort takes up extra space in memory, as new lists are made each time a list is split or two lists are combined."
False
Q7.
"A merge sort algorithm is usually slower to execute but more easier to write than bubble sort."
True
Q8.
"Merge sort is an efficient divide and conquer algorithm that can perform well in real-world use."
False

## Exit quiz

Share with pupils

### 8 Questions

Q1.
‘Split data until each item is in a list of its own and then combine pairs of lists repeatedly so that the items are in order.’
Binary search
Bubble sort
Insertion sort
Q2.
‘Move through a list repeatedly, comparing items next to each other and swapping them if they are in the wrong order.’
Insertion sort
Linear search
Merge sort
Q3.
Analyse the flow chart below. Which algorithm does this represent?
Binary search
Bubble sort
Merge sort
Q4.
What does the initial value of -1 indicate?
the item has been found.
Correct answer: the item has not been found.
Q5.
Which sort splits data repeatedly until each item is in a list of its own
Bubble sort
Insertion sort
Q6.
Which sort creates a new list each time two lists are combined
Bubble sort
Insertion sort
Q7.
An advantage of merge sort over bubble sort is that it is faster to sort large lists and lists that are less ordered.
False