The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely.[1] This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space.
Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as etc., where n is a characteristic of the input influencing space complexity.
^Kuo, Way; Zuo, Ming J. (2003), Optimal Reliability Modeling: Principles and Applications, John Wiley & Sons, p. 62, ISBN 9780471275459
The spacecomplexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a...
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource...
Combinatorial game theory measures game complexity in several ways: State-spacecomplexity (the number of legal game positions from the initial position)...
asymptotic time complexity and asymptotic spacecomplexity are commonly estimated. Other asymptotically estimated behavior include circuit complexity and various...
the time/spacecomplexity of a particular problem in terms of all algorithms that solve it with computational resources (i.e., time or space) bounded...
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus...
i\right)=O(n\log n).} The space used by quicksort depends on the version used. The in-place version of quicksort has a spacecomplexity of O(log n), even in...
particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory)...
the number of steps it takes (its time complexity) or the number of storage locations it uses (its spacecomplexity). An algorithm is said to be efficient...
Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent...
the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly...
memory locations, regardless of the size of the array. Therefore, the spacecomplexity of binary search is O ( 1 ) {\displaystyle O(1)} in the word RAM model...
computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space. If we...
performing as few subroutine calls as possible. Typically, also, the spacecomplexity of an algorithm for the cycle detection problem is of importance: we...
Global Information
