Algorithmic Complexity¶
Algorithmic complexity, also called computational complexity, refers to the study of the resources required by an algorithm to solve a problem as a function of the input size. It helps us understand how efficient an algorithm is, especially as the input size grows.
Algorithmic complexity matters for scalability, resource optimisation, performance forecast and server dimensionning.
The resources may be time, processing power, memory, disk usage or other computational resources.
Algorithmic complexity may be measured by metrics.
See also Complexity analysis and code optimisation with PHP and algorithmic complexity.
Related : Metrics, Big-o-notation, Complexity, Data Structure
