login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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: A301940 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 17:24 EDT 2019. Contains 328037 sequences. (Running on oeis4.)