Changes

Jump to: navigation, search

GPU610/SSD

44 bytes added, 20:43, 14 April 2013
Closest Pair
The closest pair problem can be explained simply by imagining a random set of points spread in a [http://en.wikipedia.org/wiki/Metric_space metric space]. Now the process of finding two points with the smallest distance between them is called the closest pair problem.
1
edit

Navigation menu