Become a member
Sign in
Closest pair of points in Python (divide and conquer): the quick implementation
263
13
Andriy Lazorenko
Anoubhav Agarwaal
Anoubhav Agarwaal
Sep 9, 2018 · 1 min read

Why did we choose to call the brute force function when the number of points is less than 3? Why not 4 or 5? Is ≤3 points optimal? How to verify?

Also, don’t Qx and Qy have many same points. Why are we doing that double counting?

    Anoubhav Agarwaal

    Written by

    Anoubhav Agarwaal

    Write the first response

    Discover Medium

    Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch

    Make Medium yours

    Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore

    Become a member

    Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade
    AboutHelpLegal