(computing theory) The time complexity, denoted O(n), of an algorithm whose running time increases at most linearly with the size of the input.