Big-O notation
A way of describing how an operation's work grows as the data grows, ignoring constant factors.
O(1) constant, O(log n) logarithmic, O(n) linear, O(n log n), O(n²) quadratic, where n is the number of elements.
Examples
ArrayList.get(i)is O(1);ArrayList.contains(x)is O(n).