Space complexity

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In computer science, the space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of the size of the input.[1]

See also[edit]

References[edit]