A117627 - OEIS

This site is supported by donations to The OEIS Foundation.

A117627

Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).

0, 2, 16, 112, 832, 6896, 62368, 619904 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.`
	FORMULA	`Knuth gives an explicit formula.`
	CROSSREFS	`Cf. A117627.` `Sequence in context: A012024 A193217 A058121 * A117628 A037564 A125725` `Adjacent sequences: A117624 A117625 A117626 * A117628 A117629 A117630`
	KEYWORD	`nonn,more`
	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 20:38 EST 2012. Contains 205962 sequences.