Linear Space Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
||
| Line 14: | Line 14: | ||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Revision as of 13:50, 8 March 2021
A Linear Space Algorithm is an algorithm whose algorithm space complexity can be bounded by a linear function.
- …
- Counter-Example(s):
- See: Maximal Common Subsequence.
References
1975
- (Hirschberg, 1975) ⇒ Daniel S. Hirschberg. (1975). “A Linear Space Algorithm for Computing Maximal Common Subsequences.” In: Communications of the ACM, 186).