This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
8 - Classification of 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’.
Constant
Tractable
Efficiency
Intractable
Linear
Halting
Heuristic
Logarithmic
A generic measure of what is produced by any system, based on resources used
The problem of determining whether a program will finish running or continue indefinitely
A technique to attempt to speed up solving a problem
A problem that cannot be solved in polynomial time or less
Problems solvable in linear or logarithmic time are examples of this category of problem
The time complexity of identifying the smallest value in an unordered list
The time complexity of a binary search
The most favourable time complexity in terms of minimising resource use