What is Big O notation?

Big O notation describes how an algorithm's running time grows as the input size n increases, usually in the worst case. Common complexities are O(1), O(log n), O(n), O(n log n), O(n²) and O(2ⁿ). To simplify, keep the fastest-growing term and drop constants, so 3n² + 5n becomes O(n²).