Linear Space Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 5: | Line 5: | ||
** a [[Linear Time Algorithm]]. | ** a [[Linear Time Algorithm]]. | ||
* <B>See:</B> [[Maximal Common Subsequence]]. | * <B>See:</B> [[Maximal Common Subsequence]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 18:52, 17 September 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).