**Problem Summary:**

According to problem, We will be given

**n**points on the plane, each represented by

**(x, y)**coordinates, our task is to find a pair of points with the smallest distance between them and print only distance between them.

This is a standard

**closest pair of points problem**or

**closest pair problem**( Wiki Link ).

So, Closest pair problem is a problem in computational geometry where we will be provided an array of points as an input set and we have to find out two points among them whose distance is minimum and find out distance between these points as an output. Particularly we consider all the points lies in two dimensional space and we euclidean distance as a measure for the distance among points.

**Solution Idea:**

One obvious brute-force solution could be picking all possible pairs of points and finding out euclidean distance among them and hence selecting a pair with minimum distance among them. The sample …