What does the term 'linear time complexity' mean in the context of algorithms, and how does it affect performance?

Linear time complexity (denoted as O(n)) means that the execution time of an algorithm grows proportionally to the size of the input data. If the number of elements doubles, the running time roughly doubles.

This is an important metric because algorithms with linear complexity are generally considered efficient for processing large volumes of data. For example, a simple pass through a list to find an element is an algorithm with linear complexity.

Example in Python:

def find_element(lst, target):
    for item in lst:
        if item == target:
            return True
    return False

Here, the runtime depends on the length of the list lst.