Computational Complexity

Computational complexity describes an algorithm’s time or space requirements in relation to the size of its input. This is often represented in Big-O notation. For example, if the time complexity of an algorithm is O(n), this means that the time it takes to complete is a linear function of its input size, n.