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,2

References

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

Links

Table of n, a(n) for n=1..8.

Crossrefs

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

Sequence in context: A370270 A058121 A117627 * A288971 A288970 A037564

Adjacent sequences: A117625 A117626 A117627 * A117629 A117630 A117631

Keyword

nonn

Author

N. J. A. Sloane, Oct 06 2006

Status

approved