The coordinates of any n point on the horizontal axis x are given as x1,x2 ,... ,xn Find the divide and conquer type of algortihm, which gives the nearest pair of points, determine the T(n) runtime.

(pseudo code or c++ code)