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.

8 - Classification of 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

An algorithm comprising a nested 'for' loop

Accessing the first element of an array

Given a list of students, identifying every possible pairing

Outputting the size of an array

Calculating the mean from values in an array of integers

Popping each item from a stack in turn

Accessing the midpoint of an array

Bubble sort

Binary search

Linear search

Identifying the largest value in an array of non-sequential integers

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

Pass Mark

70%