NIST

best-case cost

(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


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "best-case cost", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bestcasecost.html