This section provides an overview of what time-complexity is, and why a developer might want to use it.

It should also mention any large subjects within time-complexity, and link out to the related topics. Since the Documentation for time-complexity is new, you may need to create initial versions of those related topics.

All five classes in the Landau system describe asymptotic behaviour, i.e. the behaviour when the size of the problem tends to infinity. While this might look irrelevant to our – very finite – real world problems, experience has shown that behaviour of real world algorithms mirrors this infinite behaviour well enough on real data to be of practical use.