The time it takes to run the function as the size of the input (to the function grows)
Big O notation used to express time complexity
time complexity: linear time complexity – as size increases the time increases linearly
linear time – O(n)
constant time complexity – as size increases time stays constant O(1)
quadratic time complexity – time increases like quadratic function O(n2)