Big O notation
A way of describing how an algorithm's run time or memory use grows as its input size grows, ignoring constant factors.
Example:Saying a linear search is O(n) because checking twice as many items takes roughly twice as long, versus O(1) for a hash lookup that takes the same time regardless of size.