Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • $\begingroup$ Is this helpful: stackoverflow.com/questions/41403587/… and geeksforgeeks.org/closest-pair-of-points-onlogn-implementation $\endgroup$ Commented Sep 13, 2018 at 1:55
  • $\begingroup$ @Rob Thats it, closest pair algorithm I think, thanks $\endgroup$ Commented Sep 13, 2018 at 2:07
  • 1
    $\begingroup$ @Rob thanks for that. I'm going to wait in case someone else has a better solution as a divide and conquer algorithm with 2 quicksorts might in fact be overkill in my situation when there's going to be 20 conditions for the sort. $\endgroup$ Commented Sep 13, 2018 at 2:30
  • $\begingroup$ If you could specify which algorithm you wanted to use in your question it would narrow down the answer to a speed/complexity appropriate answer. I suggested that algorithm because you wanted an improvement over $O(n^2)$. $\endgroup$ Commented Sep 13, 2018 at 3:03