We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6aa1b16 commit 56ddb52Copy full SHA for 56ddb52
src/main/java/com/thealgorithms/randomized/ClosestPair.java
@@ -3,6 +3,11 @@
3
import java.math.RoundingMode;
4
import java.util.*;
5
6
+// As required by Repository, new algorithms have URL in comments with explanation
7
+// https://www.geeksforgeeks.org/closest-pair-of-points-using-divide-and-conquer-algorithm
8
+// Given 2 or more points on a 2-dimensional plane, find the closest 2 points in Euclidean distance
9
+// This class uses the divide and conquer technique with recursion
10
+
11
final class Point implements Comparable<Point> {
12
double x;
13
double y;
0 commit comments