(definition)
Definition: (1) The situation or input for which an algorithm or data structure takes the least time or resources. (2) Having to do with this situation or input.
See also average case, worst case, best-case cost.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:02:26 2004.
HTML page formatted Wed Oct 26 09:47:14 2005.
Cite this as:
Paul E. Black, "best case", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bestcase.html
