Topic: Divide And Conquer Problem / Level: advanced

Problem: Implement a divide and conquer approach for finding the "Closest Pair of Points" in a sorted list.

Run the code to see the output here...