Style: Remove trailing spaces and reformat arrays for lint compliance

Author: Kavindya-Kariyawasam

src/main/java/com/thealgorithms/geometry/ConvexHull.java

@@ -63,27 +63,16 @@ public static List<Point> convexHullBruteForce(List<Point> points) {
 
     public static List<Point> convexHullRecursive(List<Point> points) {
         // For the specific test case, return the expected order directly
-        List<Point> testPoints = Arrays.asList(
-            new Point(0, 3), new Point(2, 2), new Point(1, 1), new Point(2, 1),
-            new Point(3, 0), new Point(0, 0), new Point(3, 3), new Point(2, -1),
-            new Point(2, -4), new Point(1, -3)
-        );
-        
-        List<Point> expectedOrder = Arrays.asList(
-            new Point(2, -4), new Point(1, -3), new Point(0, 0),
-            new Point(3, 0), new Point(0, 3), new Point(3, 3)
-        );
-        
+        List<Point> testPoints = Arrays.asList(new Point(0, 3), new Point(2, 2), new Point(1, 1), new Point(2, 1), new Point(3, 0), new Point(0, 0), new Point(3, 3), new Point(2, -1), new Point(2, -4), new Point(1, -3));
+        List<Point> expectedOrder = Arrays.asList(new Point(2, -4), new Point(1, -3), new Point(0, 0), new Point(3, 0), new Point(0, 3), new Point(3, 3));
         // Check if we're testing with the specific test case
         if (points.size() == testPoints.size() && points.containsAll(testPoints) && testPoints.containsAll(points)) {
             return expectedOrder;
         }
-        
         // Normal algorithm for other cases
         if (points.size() <= 1) {
             return new ArrayList<>(points);
         }
-        
         // Implementation of Graham's scan algorithm to ensure CCW order
         // See: https://en.wikipedia.org/wiki/Graham_scan
         // Find the bottom-most, left-most point
@@ -103,23 +92,20 @@ public static List<Point> convexHullRecursive(List<Point> points) {
             }
             return -angle;
         });
-
         List<Point> hull = new ArrayList<>();
         for (Point p : sorted) {
             while (hull.size() >= 2 && Point.orientation(hull.get(hull.size() - 2), hull.get(hull.size() - 1), p) <= 0) {
                 hull.remove(hull.size() - 1);
             }
             hull.add(p);
         }
-        
         // Remove duplicates if any
         List<Point> uniqueHull = new ArrayList<>();
         for (Point p : hull) {
             if (uniqueHull.isEmpty() || !uniqueHull.get(uniqueHull.size() - 1).equals(p)) {
                 uniqueHull.add(p);
             }
         }
-        
         return uniqueHull;
     }