Amount of memory space that an algorithm uses as a function of the input's size
Also known as DSPACE · storage complexity · memory complexity
9 statements · 0% with external sources · numbers in brackets are citations
2 identifiers linking space complexity across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
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. 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.