Consider a collection of 2-dimensional points, implemented as an array of 2-tuples (x,y).

If implemented as 2 parallel arrays of floats instead, which operation would be most likely benefit from higher cache hits?

1. eucidean distance between points

2. a visualization plot

3. nearest neighbor search

4. bounding box coordinates