Topic: Divide And Conquer Problem / Level: advanced

Problem: Write a divide and conquer approach for the "Closest Pair of Points" problem in a 3D space.

Run the code to see the output here...