A117628 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.`
	CROSSREFS	`A117627 is a lower bound.` `Sequence in context: A193217 A058121 A117627 * A037564 A125725 A162723` `Adjacent sequences: A117625 A117626 A117627 * A117629 A117630 A117631`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Oct 06 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:43 EST 2012. Contains 205863 sequences.