Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance?
(a) Brute force
(b) Exhaustive search
(c) Divide and conquer
(d) Branch and bound
The question was asked in an online interview.
My query is from Computational Geometry topic in portion Computational Geometry of Data Structures & Algorithms II