Space Complexity Analysis

From GM-RKB
(Redirected from DSPACE)
Jump to navigation Jump to search

A Space Complexity Analysis is an algorithm complexity analysis that focuses on Size of Data Structures used by an Algorithm to solve a Task.



References

2014

2009

  • (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Space_complexity
    • To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or complexity of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).