I will present the Khuller-Matias closest pair algorithm for points in the d-dimensions. The algorithm takes expected $O(n)$ time.