T(n) can be classified into 3:

1 Best Case Time Complexity

- least no. of operations required by the algorithm to produce the solution of
the problem given a particular configuration of the input.
2

Worst Case Time Complexity

- greatest no. of operations required by the algorithm to produce the solution
of the problem given a particular configuration of the input.

Average Case Time Complexity

- all the possible configurations of the input are identified and in each such
configuration, the time complexity is determined. The average of all these
time complexity is then computed.