Big-O

Also written: O(n), O(n²), O(n log n), O(1), O(log n)

A way to describe how a solution's running time or memory use grows with the input size n. It is used to choose a target from the problem's constraints and to state a solution's time and space cost.