Last active
August 29, 2015 14:04
-
-
Save kartikkukreja/a1baa687d37582e82a93 to your computer and use it in GitHub Desktop.
Closest Pair of Points Problem
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| let P be the array of N points | |
| minDist = infinity | |
| for i = 1 to N-1 | |
| for j = i+1 to N | |
| if dist(P[i], P[j]) < minDist | |
| minDist = dist(P[i], P[j]) | |
| closestPair = (P[i], P[j]) | |
| return closestPair |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment