An analysis of the computational resources required by an algorithm as a function of the size of the input, typically expressed using Big O notation to describe the worst-case behavior.

"The time complexity of the algorithm was O(n log n) in the worst case."