Oak ComputingTest · Computing

Merge sort

The starter and exit quiz of the lesson “Merge sort”, from the unit “Searching and sorting algorithms” (Year 10 Computing) by Oak National Academy.

Free to use. Edit it, share it and hand it out to your students.

Oak National Academy

12 questions

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?
What is a "pass" 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:
What is the first step in a merge sort?
Match the terms to their definitions:
What is the purpose of merging in merge sort?
Place the steps of merge sort in the correct order:
What is one disadvantage of merge sort?
Which is faster for smaller data sets: merge sort or bubble sort?

License: OGL