File tree Expand file tree Collapse file tree 1 file changed +6
-5
lines changed
src/main/java/com/thealgorithms/divideandconquer Expand file tree Collapse file tree 1 file changed +6
-5
lines changed Original file line number Diff line number Diff line change @@ -29,11 +29,12 @@ public ArrayList<Point> getPoints() {
29
29
}
30
30
31
31
/**
32
- * The main divide and conquer, and also recursive algorithm. It gets an
33
- * ArrayList full of points as an argument. If the size of that ArrayList is
34
- * 1 or 2, the ArrayList is returned as it is, or with one less point (if
35
- * the initial size is 2 and one of it's points, is dominated by the other
36
- * one). On the other hand, if the ArrayList's size is bigger than 2, the
32
+ * The main divide and conquer, and also recursive algorithm.
33
+ * It gets an ArrayList full of points as an argument.
34
+ * If the size of that ArrayList is 1 or 2, the ArrayList is
35
+ * returned as it is, or with one less point (if the initial size is 2
36
+ * and one of it's points, is dominated by the other one).
37
+ * On the other hand, if the ArrayList's size is bigger than 2, the
37
38
* function is called again, twice, with arguments the corresponding half of
38
39
* the initial ArrayList each time. Once the flashback has ended, the
39
40
* function produceFinalSkyLine gets called, in order to produce the final
You can’t perform that action at this time.
0 commit comments