(definition)

Definition: (1) Proportional to. (2) Asymptotically equal to. A theoretical measure of the execution of an algorithm, usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) g(n) means it grows at the same rate as g(n). More formally, it means lim_{x → ∞}f(x)/g(x) = 1.

See also big-O notation, Θ(n), asymptotically tight bound.

Author: PEB

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

Entry modified Fri Dec 17 12:07:40 2004.
HTML page formatted Wed Oct 26 09:47:07 2005.

Cite this as:
Paul E. Black, "", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/sim.html