Add RandomizedClosestPair Algorithm and Unit Tests #6339
Conversation
aditya-7562
requested review from
DenizAltunkapan,
yanglbme,
vil02,
BamaCharanChhandogi,
alxkm and
siriak
as code owners
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #6339 +/- ##
============================================
+ Coverage 74.36% 74.41% +0.04%
- Complexity 5403 5419 +16
============================================
Files 680 681 +1
Lines 18842 18888 +46
Branches 3656 3665 +9
============================================
+ Hits 14012 14055 +43
- Misses 4274 4276 +2
- Partials 556 557 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
…LE check failure. Maintains overall test coverage and functional correctness.
|
👋 Hi maintainers, I wanted to clarify that this PR has multiple commits because I’m a first-time contributor to this repository and was learning the contribution and CI process along the way. I’ve since cleaned up the implementation, removed the private constructor test due to CodeQL/Infer warnings, and ensured the code follows all formatting, naming, and coverage guidelines. The Infer job is currently failing due to an OCaml dependency conflict (camlzip = 1.12), which appears unrelated to the actual code changes. All required tests pass, and the patch coverage is above 93%. Please let me know if you'd prefer that I squash the commits or make any other changes. Thank you for your time and for maintaining this amazing repository! 🙏 |
Summary
Added Randomized Closest Pair of Points algorithm under the
randomizedcategory as per issue #6219.This algorithm efficiently finds the minimum Euclidean distance between any two points in a 2D plane using a randomized divide-and-conquer approach.
Randomized Algorithm Approach
d.Time Complexity
Use Cases
Checklist
CONTRIBUTING.mdclang-format -i --style=file path/to/your/file.java