Fix bug in closest pair of points

Author: coderick14

closestPair.cpp

@@ -59,15 +59,17 @@ double closestPair(vector<point> &pointsByX, vector<point> &pointsByY, ll low, l
 	double bestDistance = min(distLeft, distRight);
 
 	vector<point> pointsInStrip;
-	for(i=0; i<n && abs(pointsByY[i].x - pointsByX[mid].x) < bestDistance; i++) {
-		pointsInStrip.push_back(pointsByY[i]);
+	for(i=0; i<n; i++) {
+        if(abs(pointsByY[i].x - pointsByX[mid].x) < bestDistance)
+		    pointsInStrip.push_back(pointsByY[i]);
 	}
 
 	for(i=0; i<pointsInStrip.size(); i++) {
 		for(j=i+1; j<pointsInStrip.size() && abs(pointsInStrip[i].y - pointsInStrip[j].y) < bestDistance; j++) {
 			double dist = euclideanDistance(pointsInStrip[i], pointsInStrip[j]);
 			if(dist < bestDistance) {
 				bestDistance = dist;
+                minDist = dist;
 				result1 = pointsInStrip[i];
 				result2 = pointsInStrip[j];
 			}
@@ -92,4 +94,4 @@ int main() {
 	cout<<"Shortest distance = "<<closestPair(pointsByX, pointsByY, 0, n-1)<<endl;
 	cout<<"Points are ("<<result1.x<<","<<result1.y<<") and ("<<result2.x<<","<<result2.y<<")\n";
 	return 0;
-}
+}