Algorithmintro
Brute-force nearest neighbor search
Also called linear scan, exhaustive search for NN.
Compute the distance from the query to every point and keep the smallest; the baseline all indexes are measured against.
Compute the distance from the query to every point and keep the smallest; the baseline all indexes are measured against.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag VXFMJM Edit this page History Report an error