NIST

asymptotic upper bound

(definition)

Definition: See big-O notation.

Author: PEB


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 6 September 2019.
HTML page formatted Fri Sep 6 15:28:12 2019.

Cite this as:
Paul E. Black, "asymptotic upper bound", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 September 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/asymptoticUpperBound.html