I have an assignment which compares 2 different algorithms for a problem. Here's the problem:

Suppose I have a series of xy coords like this :

A(2,3), 
B(5,6), 
C(7,8), 
D(6,2), 
E(5,5), etc..

And I want to find 2 coords which have the shortest distance between them. One of the solution is using brute force (matching them one by one), but there is another solution using "divide and conquer" method..

Can you help me with the "divide and conquer" method?