A measure of algorithmic performance.
Computational complexity is a fundamental (and complicated) field of the programming theory. If you are an experienced programmer, you should know more than enough about complexity for the purpose of reading this reference.
But if you don't know anything about complexity, then the following list should give you all the basic information you may need to understand this reference:
- O(1) - constant complexity - the function works very fast, regardless of the input
- O(lgn) - logarithmic complexity - the function isn't as fast as O(1), but still pretty fast, and barely depends on the size of the input
- O(n) - linear complexity - the function is reasonably fast, but gets proportionally slower as its input grows, i.e. for an input 10 times larger, the function will work about 10 times slower
- O(nlgn) - linear-logarithmic complexity - the function gets even slower than O(n) as its input grows, but not by much
Let us know
Please Contact us to report any errors on this page, or to suggest any improvements.