-
Notifications
You must be signed in to change notification settings - Fork 0
Used recursion and Divide and Conquer to find the closest pair of points in a dataset. Applied the Master Theorem for time complexity analysis, achieving O(n log n) runtime. The program calculates Euclidean distance, processes input files, and uses sorting, all with O(n log n) complexity
j3meshenry/ClosestPairofPointsAlgorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
Used recursion and Divide and Conquer to find the closest pair of points in a dataset. Applied the Master Theorem for time complexity analysis, achieving O(n log n) runtime. The program calculates Euclidean distance, processes input files, and uses sorting, all with O(n log n) complexity
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published