Q733
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
AnswerB.
Exhaustive search
C.
Divide and conquer
D.
Branch and bound
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board