Topic: Divide And Conquer Problem / Level: advanced

Problem: Implement a divide and conquer algorithm to find the "Closest Pair of Points" in a set of 2D coordinates.

Run the code to see the output here...