Note: The translation for this entry is currently under quality review. Some content is temporarily displayed in English only.
space complexity
This term is a technical metric used primarily in computer science and computational theory to quantify the memory efficiency of an algorithm. It focuses on the peak memory usage during execution, including both the auxiliary space and the space used by the input. It is almost always discussed in tandem with time complexity to provide a complete picture of an algorithm's resource requirements.
In professional and academic contexts, space complexity is typically expressed using Big O notation (e.g., O(1) for constant space or O(n) for linear space). This abstraction allows developers to predict how a program will scale as the input size grows, regardless of the specific hardware or operating system being used.