Skip to content

Add Divide and Conquer: Closest Pair of Points algorithm #2969

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add Divide and Conquer: Closest Pair of Points algorithm #2969

wants to merge 1 commit into from

Conversation

PayalB24
Copy link

Added Closest Pair of Points using Divide and Conquer

  • Language: C++
  • Algorithm: Closest Pair of Points (2D)
  • Approach: Divide and Conquer
  • File: divide_and_conquer/closest_pair_of_points.cpp

Let me know if any changes are needed. Thank you!

realstealthninja
realstealthninja requested changes Jul 25, 2025
View reviewed changes
Copy link
Collaborator

@realstealthninja realstealthninja left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

please dont use the bits/stdc++ header as it is not portable, i.e compatible on anything other than windows

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@realstealthninja realstealthninja realstealthninja requested changes

@Panquesito7 Panquesito7 Awaiting requested review from Panquesito7 Panquesito7 is a code owner

Requested changes must be addressed to merge this pull request.

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@PayalB24 @realstealthninja