Since the time taken on different inputs of the same size can be different, the worst-case time complexity T(n) is defined to be the maximum time taken over all inputs of size n.
How is worst-case time complexity written as an expression?
T(n)