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, worst-case execution time, 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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 August 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "worst-case cost", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 August 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/worstcaseCost.html