fix: clang issues

Author: saahil-mahato

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

@@ -27,7 +27,7 @@ public static List<int[]> generateCirclePoints(int centerX, int centerY, int rad
 
         // Special case for radius 0, only the center point should be added.
         if (radius == 0) {
-            points.add(new int[]{centerX, centerY});
+            points.add(new int[] {centerX, centerY});
             return points;
         }
 
@@ -72,13 +72,13 @@ public static List<int[]> generateCirclePoints(int centerX, int centerY, int rad
      */
     private static void addSymmetricPoints(List<int[]> points, int centerX, int centerY, int x, int y) {
         // Octant symmetry points
-        points.add(new int[] { centerX + x, centerY + y });
-        points.add(new int[] { centerX - x, centerY + y });
-        points.add(new int[] { centerX + x, centerY - y });
-        points.add(new int[] { centerX - x, centerY - y });
-        points.add(new int[] { centerX + y, centerY + x });
-        points.add(new int[] { centerX - y, centerY + x });
-        points.add(new int[] { centerX + y, centerY - x });
-        points.add(new int[] { centerX - y, centerY - x });
+        points.add(new int[] {centerX + x, centerY + y});
+        points.add(new int[] {centerX - x, centerY + y});
+        points.add(new int[] {centerX + x, centerY - y});
+        points.add(new int[] {centerX - x, centerY - y});
+        points.add(new int[] {centerX + y, centerY + x});
+        points.add(new int[] {centerX - y, centerY + x});
+        points.add(new int[] {centerX + y, centerY - x});
+        points.add(new int[] {centerX - y, centerY - x});
     }
 }

src/test/java/com/thealgorithms/geometry/MidpointCircleTest.java

@@ -23,10 +23,11 @@ class MidpointCircleTest {
      */
     @ParameterizedTest
     @CsvSource({
-            "0, 0, 3",  // Circle centered at (0, 0) with radius 3
-            "10, 10, 2" // Circle centered at (10, 10) with radius 2
+        "0, 0, 3",  // Circle centered at (0, 0) with radius 3
+        "10, 10, 2" // Circle centered at (10, 10) with radius 2
     })
-    void testGenerateCirclePoints(int centerX, int centerY, int radius) {
+    void
+    testGenerateCirclePoints(int centerX, int centerY, int radius) {
         List<int[]> points = MidpointCircle.generateCirclePoints(centerX, centerY, radius);
 
         // Ensure that all points satisfy the circle equation (x - centerX)^2 + (y - centerY)^2 = radius^2
@@ -38,8 +39,7 @@ void testGenerateCirclePoints(int centerX, int centerY, int radius) {
             int dy = y - centerY;
             int distanceSquared = dx * dx + dy * dy;
 
-            assertTrue(Math.abs(distanceSquared - radius * radius) <= 1,
-                    "Point (" + x + ", " + y + ") does not satisfy the circle equation.");
+            assertTrue(Math.abs(distanceSquared - radius * radius) <= 1, "Point (" + x + ", " + y + ") does not satisfy the circle equation.");
         }
     }
 
@@ -51,7 +51,6 @@ void testZeroRadiusCircle() {
         List<int[]> points = MidpointCircle.generateCirclePoints(0, 0, 0);
 
         // A zero-radius circle should only have one point: (0, 0)
-        assertTrue(points.size() == 1 && points.get(0)[0] == 0 && points.get(0)[1] == 0,
-                "Zero-radius circle did not generate the correct point.");
+        assertTrue(points.size() == 1 && points.get(0)[0] == 0 && points.get(0)[1] == 0, "Zero-radius circle did not generate the correct point.");
     }
 }