Overview, Python, Time, Complexity.
runtime linearly proportional to the size of the input. For example, multiplying every number in a list by 20 will require the same number of operations as the number of items in the list. Logarithmic Time Algorithms (O(log(n))) Algorithms where the runtime grows logarithmically as the input size