**O(n)** is a notation that says that as input data grows, the execution time grows proportionally. If function needs 10 seconds to iterate over 10 elements of list and 100 seconds to do the same thing over 100 elements, then it means that time complexity is O(n), which means **linear grow.** ![[linear.png]] ### See also 1. ### Reference 1.