Closest-pair problem: Difference between revisions

Line 214:
<lang d>import std.stdio,std.typecons,std.math,std.algorithm,std.array,std.random;
 
auto bruteForceClosestPairbruteForceClosestPair2(cdouble[] points) {
double minD = double.infinity;
cdoublesize_t minI, minJ;
foreach (i; 0 .. points.length-1)
foreach (j; i+1 .. points.length) {
Line 222:
if (dist < minD) {
minD = dist;
minI = points[i];
minJ = points[j];
}
}
return tuple(minD, points[minI], points[minJ]);
}
 
Anonymous user