O(n) Linear
← Back to Common Classes
Linear time complexity. The algorithm processes each element a constant number of times. Examples include linear search, finding max/min, and single-pass array operations. The minimum for any algorithm that must examine all input.