What is wrong with my logic for the divide and conquer algorithm for Closest pair problem?
- by Programming Noob
I have been following Coursera's course on Algorithms and came up with a thought about the divide/conquer algorithm for the closest pair problem, that I want clarified.
As per Prof Roughgarden's algorithm (which you can see here if you're interested):
For a given set of points P, of which we have two copies - sorted in X and Y direction - Px and…