Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search)

From Algorithm Wiki
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: Only ever storing the current shortest distance and the corresponding node) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1940 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$

(Derived: Only ever storing the current shortest distance and the corresponding node)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Linear_search_(Nearest_Neighbor_Search_(NNS)_Nearest_Neighbor_Search)&oldid=44463"