(definition)
Definition: An asymptotic bound, as function of the size of the input, on the worst (slowest, most amount of space used, etc.) an algorithm will do to solve a problem. That is, no input will cause the algorithm to use more resources than the bound.
See also big-O notation, asymptotic lower bound, asymptotically tight bound.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov).
Entry modified Wed Jan 2 09:32:31 2002.
HTML page formatted Thu Jan 31 13:48:11 2002.
This page's original URL is http://www.nist.gov/dads/HTML/asymptoticUpperBound.html