What is complexity of an algorithm?

The complexity of an algorithm is a function f which measures the time and space used by an algorithm in terms of input size n.

In computer science, the complexity of an algorithm is a way to classify how efficient an algorithm is, compared to alternative ones. The focus is on how execution time increases with the data set to be processed. The computational complexity and efficient implementation of the algorithm are important in computing, and this depends on suitable data structures.