The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors 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
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 19:58 EDT 2024. Contains 372882 sequences. (Running on oeis4.)