What is algorithmic complexity?

Algorithmic complexity estimates the required amount of resources (time or memory) to execute an algorithm depending on the size of the input data. It is usually expressed using asymptotic notation, such as Big O.