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.

4 - 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’.

(9, 8, 7, 6, 5, 4)
(8, 7, 6, 5, 4, 9)
(8, 9, 7, 6, 5, 4)
(8, 7, 6, 9, 5, 4)
(5, 4, 6, 7, 8, 9)
(7, 6, 5, 4, 8, 9)
(8, 7, 9, 6, 5, 4)
The intermediate result of a bubble sort after a single comparison has been made on a data structure containing (9, 8, 7, 6, 5, 4)
The intermediate result of a bubble sort after a single pass has been made on a data structure initially containing (9, 8, 7, 6, 5, 4)
The intermediate result of a bubble sort after two comparisons have been made on a data structure initially containing (9, 8, 7, 6, 5, 4)
The intermediate result of a bubble sort after two passes have been made on a data structure initially  containing (9, 8, 7, 6, 5, 4)
The intermediate result of a bubble sort after three comparisons have been made on a data structure initially containing (9, 8, 7, 6, 5, 4)
The intermediate result of a bubble sort, performed on a data structure initially containing (9, 8, 7, 6, 5, 4), exactly one comparison before it's sorted into ascending order
The contents of this data structure would be appropriate to search using a binary search algorithm

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

Pass Mark
75%