1. Which term describes an algorithm that puts a list of items into order by comparing each neighbouring pair in turn, swapping them when they are in the wrong order, and repeating until a complete run makes no swaps?
Bubble sort
Merge sort
Binary search
Insertion sort
2. What is meant by 'merge sort'?
A searching algorithm that repeatedly halves a sorted list to find a particular item more quickly
A sorting algorithm that repeatedly divides a list into smaller sub-lists until each holds one item, then combines them back together in order
A sorting algorithm that takes each item in turn and places it into its correct position among the items that are already sorted, shifting larger items to the right
A sorting algorithm that compares each neighbouring pair of items in a list and swaps them when they are in the wrong order, repeating until no swaps are made in a pass