(Solved): explain extremely well with many steps. i don't understand divide snd conquer well. will upvote. ...

explain extremely well with many steps. i don't understand divide snd conquer well. will upvote. thanks.

1. [12\%] Implement the algorithm for finding the closest pair of points in two dimension plane using divide and conquer strategy. A system for controlling air or sea traffic might need to know which are the two closest vehicles in order to detect potential collisions. This part solves the problem of finding the closest pair of points in a set of points. The set consists of points in $${\mathrm{R}}^2$$ defined by both an $$\mathrm{x}$$ and a y coordinate. The "closest pair" refers to the pair of points in the set that has the smallest Euclidean distance, where Euclidean distance between points $${\mathrm{p}}_1=\left({\mathrm{x}}_1,{\mathrm{y}}_1\right)$$ and $${\mathrm{p}}_2=\left({\mathrm{x}}_2,{\mathrm{y}}_2\right)$$ is simply sqrt $$\left({\left(x_1?x_2\right)}^2+{\left(y_1?y_2\right)}^2\right)$$. If there are two identical points in the set, then the closest pair distance in the set will obviously be zero. Input data: $$n$$ points with coordinates: $$\mathrm{X}$$ coordinates: $$\mathrm{p}[0]?\mathrm{x},\mathrm{p}[1]?\mathrm{x},\mathrm{p}[2]?\mathrm{x},\dots .,\mathrm{p}[\mathrm{n}]?\mathrm{x}$$ Y coordinates: p[0].y, p[1].y, p[2].y,...., p[n].y Output: minimum distance between points $$\mathrm{p}[\mathrm{i}]$$ and $$\mathrm{p}[\mathrm{j}]$$ (index $$\mathrm{i}$$ and $$\mathrm{j}$$ should be identified)