Finding Closest Pair of Points

I am doin a small research on Divide and Conquer Algorithm(Not assignment)

Can any one help in writing a code in cpp for finding closes pair of points using Divide and Conquer Algorithm.

Do any one can help me in finding some cpp program in divide and conquer algorithm.

Thank you in advance.

Eshwar

have no idea what the divide and conquer algorithm is but i can say this:

if you have n distinct points then there is no way you can find the pair with
the least distance among them without doing the n * (n-1) /2 computations
of distance.

http://www.cs.mcgill.ca/~cs251/Close...estPairDQ.html
first hit in google...