Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer algorithm to solve the closest pair of points problem in 3D space.

Run the code to see the output here...