This is code for finding the closest pair of points from a given set of points in the 2-d plane. The code runs in O(nlogn) time complexity.
Constraints:
- Using 100x100 Grid.
- User enters the no. of points to be randomly generated.
-
Notifications
You must be signed in to change notification settings - Fork 0
akanimesh7/ClosestPairCode
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is code for finding the closest pair of points from a given set of points in the 2-d plane.The code runs in O(nlogn) time complexity.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published