Big O notation describes an upper bound on the growth of a cost (time or memory) as the input size n increases, ignoring constants and secondary terms. Common classes are O(1), O(log n), O(n), O(n log n) and O(n²), from slowest to fastest growth.
Example
3n² + 5n + 2 is O(n²).