login
A117628
Let f(n) = average number of comparisons needed for sorting n elements using merge insertion. Sequence gives n!*f(n).
3
0, 2, 16, 112, 832, 6912, 62784, 623232
OFFSET
1,2
REFERENCES
D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.
CROSSREFS
A117627 is a lower bound for any comparison-based sorting algorithm.
Sequence in context: A370270 A058121 A117627 * A288971 A288970 A037564
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 06 2006
STATUS
approved