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

Your browser does not appear to have javascript enabled. This page needs JavaScript activated to work properly. Please enable javascript or choose a different browser (Chrome or Safari)

This test is run by .
Note that your final mark will not be saved in the system.

16. Algorithms Categorise

Target Level

Running Total

Attempt

1 of 3

Click on an item, then click on a category to place it. Or, drag and drop the item into the correct category. Organise all items before clicking 'Check'.

Place each of the following algorithms into the category that most accurately describes its Big O time complexity.

Linear

Quadratic

Constant

Logarithmic

Insertion sort

Accessing the midpoint of an array

Accessing the first element of an array

Linear search

Given a list of students, identifying every possible pairing

Identifying the largest in an array of integers

Calculating the mean of an array of integers

Outputting the size of an array

Bubble sort

Binary search

This is your 1^st attempt! You get 5 marks for each one you get right first time. Good luck!

Pass Mark

70%