Big-O notation

Also written: Big-O, O(1), O(n), O(n²), O(log n), O(n log n), O(V + E)

A way to describe how the number of steps grows as the input size n grows. It drops constants and smaller terms, so n²/2 is still O(n²).

Where the book teaches it