1-)Finding the two closest points between the points read from the file.Using Divide and Conqueror Algorithm.
2-)The coordinates of the points are ordered by MergeSort according to the x value.
3-)Points are divided into binary or ternary.
4-)The closest point pairs are found in the regions formed and compared with the pairs of other regions.
5-)In addition, the two closest points can be in different regions. For this, different controls are made.