Space complexity is a measure of the amount of memory used by an algorithm during its execution. It refers to the amount of memory required to store the input and internal variables of the algorithm, and is typically measured in terms of the size of the input. The goal of an algorithm's design is to minimize the space complexity, making it more memory efficient.