A notation used to classify algorithms according to how their run time or space requirements grow as the input size grows.

"Understanding Big O notation is crucial for evaluating the efficiency of algorithms."