Space complexity is a measure of how much memory is used by an algorithm to solve a computational problem. Like time complexity, it is expressed as a function of the input space in asymptotic notation (big-O, theta, omega).
Space complexity is a measure of how much memory is used by an algorithm to solve a computational problem. Like time complexity, it is expressed as a function of the input space in asymptotic notation (big-O, theta, omega).