Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination)

From Algorithm Wiki
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Derived: store a key for each entry in the "Create Key" phase) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://link.springer.com/article/10.1023/A:1009761603038")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ words

(Derived: store a key for each entry in the "Create Key" phase)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1998

Reference

https://link.springer.com/article/10.1023/A:1009761603038

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Sorted_Neighborhood_Algorithm_(SNA)_(Duplicate_Elimination_Duplicate_Elimination)&oldid=45482"