(definition)
Definition: The highest possible use of resources of an algorithm, which occurs for the most pessimistic, or worst possible, input.
See also average-case cost, best-case cost, amortized cost, adversary.
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 12:08:45 2004.
HTML page formatted Wed Oct 26 09:48:22 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "worst-case cost", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/worstcasecst.html
