Since we usually are interested in the dependence of the time complexity on different input lengths, abusing terminology, the time complexity is sometimes referred to the mapping , defined by the maximal complexity
:of inputs with length or size .

Similar definitions can be given for space complexity, randomness complexity, etc.

Ways of speaking

Very frequently, the complexity of an algorithm is given in asymptotic Big-O Notation,

1.Previous
3.Next