there are fundamental limits on the performance of comparison sorts. a comparison sort must have an average-case lower bound of ω("n" log "n") comparison operations, which is known as linearithmic time. this is a consequence of the limited information available through comparisons alone — or, to put it differently, of the vague algebraic structure of totally ordered sets. in this sense, mergesort, heapsort, and introsort are asymptotically optimal in terms of the number of comparisons they must perform, although this metric neglects other operations. non-comparison sorts (such as the examples discussed below) can achieve o("n") performance by using operations other than comparisons, allowing them to sidestep this lower bound (assuming elements are constant-sized).