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

From Algorithm Wiki

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

Real RAM

Year

1940

Reference

-

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