The number of comparisons that a comparison sort algorithm requires increases in proportion to n log ⁡ ( n ) {\displaystyle n\log(n)} , where n {\displaystyle n} is the number of elements to sort. This bound is asymptotically tight.