(definition)
Definition: (1) The situation or input that forces an algorithm or data structure to take the most time or resources. (2) Having to do with this situation or input.
See also best case, average case, worst-case cost, amortized cost, complexity, randomized algorithm, worst-case minimum access, adversary.
Note: See the notes on worst-case behavior at Huffman coding and balanced quicksort and the link at BB(α) tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Thu Jun 2 12:13:29 2005.
HTML page formatted Wed Oct 26 09:48:22 2005.
Cite this as:
Paul E. Black, "worst case", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/worstcase.html
