Algorithmic Complexity describes how the resources an algorithm uses, such as time or memory, grow as the input size changes.
Developers use complexity analysis to compare algorithms, explain performance limits, and choose data structures that fit expected workloads.
Related concepts include Source Code, Syntax and Variable.