Closest Pair Simulation

Visualize how recursive splitting + strip filtering reduces comparisons from O(n^2) to O(n log n). Follow each phase step-by-step.

Controls

Points

1/76

Plane View

stage=split delta=∞

Step Detail

Splitting points set at median x to recurse left/right.

Pair Tracking

Current best delta: ∞
Best pair: -
Active compare: -
Strip size: -

Only next ~7 y-neighbors can improve delta.

Pseudocode Reference

Pseudocode

1function closestPair(points):
2  sort points by x
3  return recursive(points)
4function recursive(P):
5  if |P| <= 3: return bruteForce(P)
6  mid = |P|/2; L = P[0:mid]; R = P[mid:]
7  d = min(recursive(L), recursive(R))
8  strip = points within d of mid line
9  return min(d, stripClosest(strip, d))

Maximum Subarray (D&C)View Theory Strassen's Matrix Multiplication