A linear time O(n) is when the running time of an algorithm is a linear equation of its input n.
ie <MATH> \text{Running Time} = a * n + b </MATH> b is not significant as it has a low level impact on the running time.