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).
For ECE345 — Algorithms and Data Structures, we don’t need to worry about stack frames.
See also
- Space-saving trick for dynamic programming problems