What is the role of the variable n in Big O notation for algorithm complexity?

Variable n in Big O notation usually denotes the size of the input data on which the algorithm operates. It serves as a parameter indicating how the execution time or the amount of memory used by the algorithm changes as the data size increases. For example, if an algorithm has a complexity of O(n), it means that its running time grows linearly with increasing n.