Big-O

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

A way to describe how a solution's work grows as the input size n grows, ignoring small details. O(n) grows in step with n, while O(n²) grows much faster.