MCQOPTIONS
Saved Bookmarks
| 1. |
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 |
| Answer» B. Exhaustive search | |