Time complexity:

The Time Complexity of an algorithm is the representation of the amount of time required by the algorithm to execute to completion.

Time complexity is the study of the efficiency of an algorithm.

Big O notation:

Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.

Big O notation means the performance or complexity of an algorithm.