(definition)
Definition: The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation.
See also asymptotic time complexity.
Note: From Algorithms and Theory of Computation Handbook, page 19-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:02:18 2004.
HTML page formatted Wed Oct 26 09:47:12 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "asymptotic space complexity", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/asymptoticSpaceComplexity.html
