(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.
Entry modified Fri Dec 17 12:02:19 2004.
HTML page formatted Wed Oct 26 09:47:12 2005.
Cite this as:
Sandeep Kumar Shukla, "asymptotic upper bound", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/asymptoticUpperBound.html
