(definition)
Definition: The sum of costs of an algorithm over all possible inputs divided by the number of possible inputs.
See also worst-case cost, amortized cost, average case, best-case cost.
Note: From Algorithms and Theory of Computation Handbook, page 1-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:47:52 2004.
HTML page formatted Wed Oct 26 09:47:12 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "average-case cost", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/averagecscst.html
