A117628 Let f(n) = average number of comparisons needed for sorting n elements using merge insertion. Sequence gives n!*f(n).

0, 2, 16, 112, 832, 6912, 62784, 623232

Offset: 1

Author

N. J. A. Sloane, Oct 06 2006

Keywords

• nonn

References

• D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.

Crossrefs

A117627 is a lower bound for any comparison-based sorting algorithm.