Big O

Big O is a shorthand for how an algorithm’s work grows: O(1), O(log n), O(n), O(n log n), O(n²). It keeps the biggest term and drops the constants. The growth ladder Simplifying Check your understanding