Our site uses cookies. Some of the cookies we use are essential for parts of the site to operate and have already been set. You may delete and block all cookies from this site, but parts of the site will not work. To find out more about cookies on this website, see our Cookie Policy
Accept
© eRevision.uk and ZigZag Education 2025
This test is run by .
Note that your final mark will not be saved in the system.

16. Algorithms MatchUp

Target Level
C
Running Total
0
0%
Attempt
1 of 3

Click on a top box, then click on its match below. Or, drag a top box and drop it onto the correct match. Match all pairs before clicking ‘Check’.

Merge sort
Depth-first
Dijkstra's
Constant
A*
Quicksort
Binary search
Exponential
Linear
Linear search
Logarithmic
Bubble sort
Breadth-first
Insertion sort
A measure of complexity that reflects the fact that as the input size doubles the time required to process it also doubles.
When it comes to complexity, this measure is the inverse of exponential.
A measure of complexity that is also written O(2n).
This algorithm, designed to locate data items within a sorted structure, begins by looking in the middle.
An order of tree traversal which is also known as post-order.
This algorithm, in each pass, compares elements 1 and 2, then elements 2 and 3, then elements 3 and 4, and so on, swapping data items when necessary.
This algorithm entails splitting the data into individual elements, then pairing elements together, ensuring the correct order is observed. The pairs are then themselves paired together.
This algorithm typically terminates when it has either found what it's looking for or has traversed the entire data structure without finding it.
This algorithm divides the data into two sections, one of which is in order and the other of which is not. The section that is in order is initially only one data item in length.
This is a measure of complexity that does not change, regardless of the size of the input.
A path-finding algorithm that uses a heuristic.
A recursive algorithm in which one data item is identified as a pivot then all other data items are placed before the pivot or after it, depending on the desired order.
A path-finding algorithm that examines all possible routes.
An order of tree traversal wherein all nodes at one level of the tree are examined before moving on to the next level.

This is your 1st attempt! You get 3 marks for each one you get right. Good luck!

Pass Mark
75%