(definition)
Definition: The minimum cost to process an input sequence.
Also known as optimal cost.
See also worst-case cost, average-case cost, amortized cost, adversary, off-line algorithm, on-line algorithm.
Note: From Algorithms and Theory of Computation Handbook, page 10-17, 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:02:27 2004.
HTML page formatted Wed Oct 26 09:47:14 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "best-case cost", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bestcasecost.html
