Quasi-linear time

An algorithmic efficiency class with time complexity O(n·polylog(n)), that is, n multiplied by some power of log n; slightly slower than strictly linear O(n) but far better than polynomial time O(n^k), and generally regarded as near-optimal feasible efficiency for processing large-scale sequences.