Topic: Divide And Conquer Problem / Level: advanced

Problem: Use divide and conquer to solve the "Closest Pair of Points" in a 2D plane.

Run the code to see the output here...