Naive Linear Search

• Keep track of the current best vector, best-v, and best distance squared, best-squared-d.

  • For an unsearched vector v compute ||v -q||2 to see if it smaller than best-squared-d.
  • If so then replace best-v.
  • If d is moderately large it is a good idea not to compute the squared distance completely. Bail out when k < d and

Previous slide

Next slide

Back to first slide

View graphic version