the above argument provides an "absolute", rather than only asymptotic lower bound on the number of comparisons, namely formula_9 comparisons. this lower bound is fairly good (it can be approached within a linear tolerance by a simple merge sort), but it is known to be inexact. for example, formula_10, but the minimal number of comparisons to sort 13 elements has been proved to be 34.