Big-O

Also written: Big O, O(n), time complexity

A way to describe how the work or memory of a solution grows as the input size n grows, such as O(n) or O(n²). It is used to compare approaches and to choose one fast enough for the input limits.